Result 1 to 20 of 27 total
Algorithms for bandwidth consecutive multicolorings of graphs. (Extended abstract). (English)
Snoeyink, Jack (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2012, Beijing, China, May 14‒16, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29699-4/pbk). Lecture Notes in Computer Science 7285, 117-128 (2012).
1
Bandwidth of trees of diameter at most 4. (English)
Discrete Math. 312, No. 12-13, 1947-1951 (2012).
2
Proper interval graph extention problems of the complements of trees. (English)
AKCE Int. J. Graphs Comb. 7, No. 2, 121-131 (2010).
3
A study on cyclic bandwidth sum. (English)
J. Comb. Optim. 14, No. 2-3, 295-308 (2007).
4
Multi-path routing versus tree routing for VPN bandwidth provisioning in the hose model. (English)
Comput. Netw. 51, No. 6, 1725-1743 (2007).
5
Multi-path routing versus tree routing for VPN bandwidth provisioning in the hose model. (English)
Comput. Netw. 51, No. 6, 1725-1743 (2007).
6
Embedding bounded bandwidth graphs into $\ell _{1}$. (English)
Bugliesi, Michele (ed.) et al., Automata, languages and programming. 33rd international colloquium, ICALP 2006, Venice, Italy, July 10‒14, 2006. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-35904-3/pbk). Lecture Notes in Computer Science 4051, 27-37 (2006).
7
Distributed formation of core-based forwarding multicast trees in mobile ad hoc networks. (English)
Telecommun. Syst. 32, No. 4, 263-281 (2006).
8
A routing algorithm in heterogeneous overlay multicast networks. (Chinese)
J. Softw. 16, No. 6, 1112-1119 (2005).
9
Graph searching, elimination trees, and a generalization of bandwidth. (English)
Algorithmica 41, No. 2, 73-87 (2005).
10
On the band-, tree-, and clique-width of graphs with bounded vertex degree. (English)
SIAM J. Discrete Math. 18, No. 1, 195-206 (2004).
11
Multiple multicast tree allocation in IP network. (English)
Comput. Oper. Res. 31, No. 7, 1115-1133 (2004).
12
Principal curves of oriented points: theoretical and computational improvements. (English)
Comput. Stat. 18, No. 2, 293-315 (2003).
13
On number of leaves and bandwidth of trees. (English)
Acta Math. Appl. Sin., Engl. Ser. 14, No.2, 193-196 (1998).
14
Minimum bandwidth problem for embedding graphs in cycles. (English)
Networks 29, No.3, 135-140 (1997).
15
On the additive bandwidth of the complete $k$-ary tree. (English)
Congr. Numerantium 118, 209-214 (1996).
16
Weak-quasi-bandwidth and forward-bandwidth of graphs. (English)
Sci. China, Ser. A 39, No.2, 148-162 (1996).
17
The bandwidth of a tree with $k$ leaves is at most $\lceil \frac k2 \rceil$. (English)
Discrete Math. 150, No.1-3, 403-406 (1996).
18
On upper bounds of bandwidths of trees. (English)
Acta Math. Appl. Sin., Engl. Ser. 11, No.2, 152-159 (1995).
19
Bandwidth of the complete $k$-ary tree. (English)
Discrete Math. 142, No.1-3, 203-212 (1995).
20
Result 1 to 20 of 27 total
Start
Contact
Print
General Help
