|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 17 occurrences of 13 keywords
|
|
|
Results
Found 12 publication records. Showing 12 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
51 | Biing-Feng Wang |
Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel. |
IEEE Trans. Parallel Distributed Syst. |
1998 |
DBLP DOI BibTeX RDF |
Trees, cores, centers, tree contraction, the Euler-tour technique |
32 | Yan Wang, Deqiang Wang, Wei Liu, Baoyu Tian |
Efficient Parallel Algorithms for Constructing a k-Tree Center and a k-Tree Core of a Tree Network. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Shietung Peng, A. B. Stephens, Yelena Yesha |
Algorithms for a Core and k-Tree Core of a Tree. |
J. Algorithms |
1993 |
DBLP DOI BibTeX RDF |
|
17 | Enqiang Zhu, Zepeng Li, Zehui Shao, Jin Xu 0002, Chanjuan Liu |
Tree-core and tree-coritivity of graphs. |
Inf. Process. Lett. |
2015 |
DBLP DOI BibTeX RDF |
|
17 | Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku |
Efficient algorithms for a constrained k-tree core problem in a tree network. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Shietung Peng, A. B. Stephens, Yelena Yesha |
Algorithms for a K-Tree Core of a Tree. |
ICCI |
1992 |
DBLP BibTeX RDF |
|
17 | Saurabh Srivastava, R. K. Ghosh |
Cluster based routing using a k-tree core backbone for mobile ad hoc networks. |
DIAL-M |
2002 |
DBLP DOI BibTeX RDF |
multihop packet, distributed algorithms, wireless ad hoc networks, radio networks, cluster based routing |
16 | Yamin Li, Shietung Peng, Wanming Chu |
K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks. |
ISPAN |
2008 |
DBLP DOI BibTeX RDF |
overlay mesh, tree-core, Mobile ad hoc network (MANET), multicast, stability, efficiency |
12 | Debajyoti Mondal, Md. Saidur Rahman 0001 |
On the 3-Tree Core of Plane Graphs. |
TAMC |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Saurabh Srivastava, R. K. Ghosh |
Distributed algorithms for finding and maintaining a k-tree core in a dynamic network. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
12 | Akiyoshi Shioura, Takeaki Uno |
A Linear Time Algorithm for Finding a k-Tree Core. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
7 | Shan-Chyun Ku, Wei-Kuan Shih, Biing-Feng Wang |
Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network. |
ICPP |
1997 |
DBLP DOI BibTeX RDF |
Trees, cores, tree contraction, the Euler-tour technique |
Displaying result #1 - #12 of 12 (100 per page; Change: )
|
|