Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
23 | Yoram Moses, Benny Shimony |
A New Proof of the GHS Minimum Spanning Tree Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, pp. 120-135, 2006, Springer, 3-540-44624-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Daniel A. M. Rocha, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg |
A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoCOP ![In: Evolutionary Computation in Combinatorial Optimization, 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings, pp. 222-233, 2006, Springer, 3-540-33178-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Grégoire Dooms, Irit Katriel |
The Minimum Spanning Tree Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings, pp. 152-166, 2006, Springer, 3-540-46267-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Ágnes Vathy-Fogarassy, Attila Kiss 0001, János Abonyi |
Hybrid Minimal Spanning Tree and Mixture of Gaussians Based Clustering Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoIKS ![In: Foundations of Information and Knowledge Systems, 4th International Symposium, FoIKS 2006, Budapest, Hungary, February 14-17, 2006, Proceedings, pp. 313-330, 2006, Springer, 3-540-31782-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Adrian Ion, Walter G. Kropatsch, Yll Haxhimusa |
Considerations Regarding the Minimum Spanning Tree Pyramid Segmentation Method . ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSPR/SPR ![In: Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshops, SSPR 2006 and SPR 2006, Hong Kong, China, August 17-19, 2006, Proceedings, pp. 182-190, 2006, Springer, 3-540-37236-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Jochen Könemann, Asaf Levin, Amitabh Sinha |
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 41(2), pp. 117-129, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Degree-bounded spanning trees, Approximation algorithms, Spanning trees, Bicriteria approximation |
23 | Michael J. Laszlo, Sumitra Mukherjee |
Minimum Spanning Tree Partitioning Algorithm for Microaggregation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 17(7), pp. 902-911, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Timothy M. Chan |
Finding the shortest bottleneck edge in a parametric minimum spanning tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 917-918, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
23 | A. S. Nepomniaschaya |
Associative Parallel Algorithm for Dynamic Reconstruction of a Minimum Spanning Tree After Deletion of a Vertex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PaCT ![In: Parallel Computing Technologies, 8th International Conference, PaCT 2005, Krasnoyarsk, Russia, September 5-9, 2005, Proceedings, pp. 159-173, 2005, Springer, 3-540-28126-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Adrian Kosowski, Lukasz Kuszner |
A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPAM ![In: Parallel Processing and Applied Mathematics, 6th International Conference, PPAM 2005, Poznan, Poland, September 11-14, 2005, Revised Selected Papers, pp. 75-82, 2005, Springer, 3-540-34141-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Lixia Han, Yuping Wang 0003 |
A Novel Genetic Algorithm for Multi-criteria Minimum Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS (1) ![In: Computational Intelligence and Security, International Conference, CIS 2005, Xi'an, China, December 15-19, 2005, Proceedings, Part I, pp. 297-302, 2005, Springer, 3-540-30818-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Yoon-Teck Bau, Chin Kuan Ho, Hong Tat Ewe |
An Ant Colony Optimization Approach to the Degree-Constrained Minimum Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS (1) ![In: Computational Intelligence and Security, International Conference, CIS 2005, Xi'an, China, December 15-19, 2005, Proceedings, Part I, pp. 657-662, 2005, Springer, 3-540-30818-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Michael Elkin |
A faster distributed protocol for constructing a minimum spanning tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 359-368, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
23 | Edson Norberto Cáceres, Frank K. H. A. Dehne, Henrique Mongelli, Siang W. Song, Jayme Luiz Szwarcfiter |
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2004 Parallel Processing, 10th International Euro-Par Conference, Pisa, Italy, August 31-September 3, 2004, Proceedings, pp. 828-831, 2004, Springer, 3-540-22924-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Jochen Könemann, Asaf Levin, Amitabh Sinha |
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 109-121, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Ernesto Tapia, Raúl Rojas 0001 |
Recognition of On-line Handwritten Mathematical Expressions Using a Minimum Spanning Tree Construction and Symbol Dominance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GREC ![In: Graphics Recognition, Recent Advances and Perspectives, 5th InternationalWorkshop, GREC 2003, Barcelona, Spain, July 30-31, 2003, Revised Selected Papers, pp. 329-340, 2003, Springer, 3-540-22478-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Ahmed Khedr 0001, Raj Bhatnagar |
Decomposable Algorithms for Computing Minimum Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWDC ![In: Distributed Computing - IWDC 2003, 5th International Workshop, Kolkata, India, December 27-30, 2003, Proceedings, pp. 33-44, 2003, Springer, 3-540-20745-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Jun Han 0006, Graham McMahon, Stephen Sugden |
A Node-oriented Branch and Bound Algorithm for the Capacitated Minimum Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: 28th Annual IEEE Conference on Local Computer Networks (LCN 2003), The Conference on Leading Edge and Practical Computer Networking, 20-24 October 2003, Bonn/Königswinter, Germany, Proceedings, pp. 460-469, 2003, IEEE Computer Society, 0-7695-2037-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Sibylle Peuker |
Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICATPN ![In: Applications and Theory of Petri Nets 2002, 23rd International Conference, ICATPN 2002, Adelaide, Australia, June 24-30, 2002, Proceedings, pp. 374-393, 2002, Springer, 3-540-43787-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Jun Han 0006, Graham McMahon, Stephen Sugden |
A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem (Research Note). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings, pp. 404-408, 2002, Springer, 3-540-44049-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Bernard Chazelle |
A minimum spanning tree algorithm with Inverse-Ackermann type complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(6), pp. 1028-1047, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
graphs, minimum spanning trees, matroids |
23 | Enrico Nardelli, Guido Proietti, Peter Widmayer |
Maintaining a Minimum Spanning Tree Under Transient Node Failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 346-355, 2000, Springer, 3-540-41004-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege |
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, Proceedings., pp. 240-251, 2000, Springer, 3-540-41413-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Sai Ho Kwok, Anthony G. Constantinides |
A fast recursive shortest spanning tree for image segmentation and edge detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 6(2), pp. 328-332, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Gheorghe Antonoiu, Pradip K. Srimani |
Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '97 Parallel Processing, Third International Euro-Par Conference, Passau, Germany, August 26-29, 1997, Proceedings, pp. 480-487, 1997, Springer, 3-540-63440-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Sun Chung, Anne Condon |
Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '96, The 10th International Parallel Processing Symposium, April 15-19, 1996, Honolulu, Hawaii, USA, pp. 302-308, 1996, IEEE Computer Society, 0-8186-7255-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Teresa M. Przytycka, Lisa Higham |
Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings, pp. 246-258, 1996, Springer, 3-540-61422-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Drago Krznaric, Christos Levcopoulos |
Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 15th Conference, Bangalore, India, December 18-20, 1995, Proceedings, pp. 443-455, 1995, Springer, 3-540-60692-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Sudhanshu Aggarwal, Shay Kutten |
Time Optimal Self-Stabilizing Spanning Tree Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 13th Conference, Bombay, India, December 15-17, 1993, Proceedings, pp. 400-410, 1993, Springer, 3-540-57529-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
23 | Neng H. Ching, Dov Rosenfeld, Michael Braun 0001 |
Two-dimensional phase unwrapping using a minimum spanning tree algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 1(3), pp. 355-365, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
23 | Francis Suraweera, Prabir Bhattacharya |
A Parallel Algorithm for the Minimum Spanning Tree on an SIMD Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the ACM 20th Annual Conference on Computer Science, CSC '92, Kansas City, MO, USA, March 3-5, 1992, pp. 473-476, 1992, ACM, 0-89791-472-4. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
23 | Forbes D. Lewis, Nancy K. Van Cleave |
Correct and Provably Efficient Methods for Rectilinear Steiner Spanning Tree Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Computer Science Conference ![In: Computing in the 90's, The First Great Lakes Computer Science Conference, Kalamazzo, Michigan, USA, October 18-20, 1989, Proceedings, pp. 329-335, 1989, Springer, 3-540-97628-0. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
23 | C. Cheng, I. Arieh Cimet, Srikanta P. R. Kumar |
A protocol to maintain a minimum spanning tree in a dynamic topology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the ACM Symposium on Communications Architectures and Protocols, SIGCOMM 1988, Stanford, CA, USA, August 16-18, 1988, pp. 330-337, 1988, ACM, 0-89791-279-9. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
23 | Kazuo Iwama, Andrzej Lingas, Masaki Okita |
Max-Stretch Reduction for Tree Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(2), pp. 223-235, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Tree spanner, Maximum stretch, Graph augmentation, Time complexity |
23 | Kazuo Iwama, Andrzej Lingas, Masaki Okita |
Max-stretch Reduction for Tree Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, pp. 122-133, 2005, Springer, 3-540-28101-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar |
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pp. 26-39, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Alexander Zelikovsky, Ion I. Mandoiu |
Practical approximation algorithms for zero- and bounded-skew trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 407-416, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
23 | Radia J. Perlman |
An algorithm for distributed computation of a spanningtree in an extended LAN. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the Ninth Symposium on Data Communications, SIGCOMM 1985, Whistler Moutain, British Columbia, Canada, September 10-12, 1985, pp. 44-53, 1985, ACM, 0-89791-164-4. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
22 | Refael Hassin, Jérôme Monnot, Danny Segev |
Approximation algorithms and hardness results for labeled connectivity problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(4), pp. 437-453, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Labeled connectivity, Approximation algorithms, Hardness of approximation |
22 | Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001 |
Parameterized Algorithms for Directed Maximum Leaf Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 352-362, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Amaro de Sousa, Gil Soares |
Improving Load Balance of Ethernet Carrier Networks Using IEEE 802.1S MSTP with Multiple Regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networking ![In: NETWORKING 2006 - Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 5th International IFIP-TC6 Networking Conference, Coimbra, Portugal, May 15-19, 2006, Proceedings, pp. 1252-1260, 2006, Springer, 3-540-34192-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Huaijun Qiu, Edwin R. Hancock |
Graph Matching using Commute Time Spanning Tr. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (4) ![In: 18th International Conference on Pattern Recognition (ICPR 2006), 20-24 August 2006, Hong Kong, China, pp. 955, 2006, IEEE Computer Society, 0-7695-2521-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Huaijun Qiu, Edwin R. Hancock |
Graph Matching using Commute Time Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (3) ![In: 18th International Conference on Pattern Recognition (ICPR 2006), 20-24 August 2006, Hong Kong, China, pp. 1224-1227, 2006, IEEE Computer Society, 0-7695-2521-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Refael Hassin, Jérôme Monnot, Danny Segev |
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 480-491, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Huaijun Qiu, Edwin R. Hancock |
Spanning Trees from the Commute Times of Random Walks on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAR (2) ![In: Image Analysis and Recognition, Third International Conference, ICIAR 2006, Póvoa de Varzim, Portugal, September 18-20, 2006, Proceedings, Part II, pp. 375-385, 2006, Springer, 3-540-44894-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | José Carlos Sancho, Antonio Robles, José Duato |
An Effective Methodology to Improve the Performance of the Up*/Down* Routing Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 15(8), pp. 740-754, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Hanan Luss, Richard T. Wong |
Survivable telecommunications network design under different types of failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Part A ![In: IEEE Trans. Syst. Man Cybern. Part A 34(4), pp. 521-530, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Cyril Banino, Olivier Beaumont, Arnaud Legrand, Yves Robert |
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARA ![In: Applied Parallel Computing Advanced Scientific Computing, 6th International Conference, PARA 2002, Espoo, Finland, June 15-18, 2002, Proceedings, pp. 423-432, 2002, Springer, 3-540-43786-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Mikkel Thorup, David R. Karger |
Dynamic Graph Algorithms with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings, pp. 1-9, 2000, Springer, 3-540-67690-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
22 | Takeaki Uno |
A New Approach for Speeding Up Enumeration Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 287-296, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
22 | Alpár Jüttner, Ádám Magi |
Tree Based Broadcast in Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 10(5), pp. 753-762, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
ad-hoc networks, multicast, wireless LANs, broadcast, routing algorithms |
22 | Konstantinos Kalpakis, Koustuv Dasgupta, Ouri Wolfson |
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 12(6), pp. 628-637, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
multicasting, Data replication, facility location, tree networks, p-medians, file allocation |
21 | Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar |
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 157-189, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Combinatorial optimization, Matching, Minimum spanning trees |
21 | Michael Schuresko, Jorge Cortés 0001 |
Distributed Tree Rearrangements for Reachability and Robust Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 12th International Conference, HSCC 2009, San Francisco, CA, USA, April 13-15, 2009. Proceedings, pp. 470-474, 2009, Springer, 978-3-642-00601-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Thilmee M. Baduge, Kazushi Ikeda, Hirozumi Yamaguchi, Teruo Higashino |
Stability Oriented Overlay Multicast for Multimedia Streaming in Multiple Source Context. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2008, Beijing, China, 19-23 May 2008, pp. 5708-5714, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Knut-Helge Vik, Pål Halvorsen, Carsten Griwodz |
Multicast Tree Diameter for Dynamic Distributed Interactive Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: INFOCOM 2008. 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 13-18 April 2008, Phoenix, AZ, USA, pp. 1597-1605, 2008, IEEE, 978-1-4244-2026-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Bor-Yiing Su, Yao-Wen Chang, Jiang Hu |
An Exact Jumper-Insertion Algorithm for Antenna Violation Avoidance/Fixing Considering Routing Obstacles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(4), pp. 719-733, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan Zhang |
Two Tree-Based Algorithms for Network Spare Capacity Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007), 3-6 December 2007, Adelaide, Australia, pp. 279-284, 2007, IEEE Computer Society, 0-7695-3049-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Bor-Yiing Su, Yao-Wen Chang, Jiang Hu |
An optimal jumper insertion algorithm for antenna avoidance/fixing on general routing trees with obstacles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2006 International Symposium on Physical Design, ISPD 2006, San Jose, California, USA, April 9-12, 2006, pp. 56-63, 2006, ACM, 1-59593-299-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
jumper insertion, antenna effect |
21 | Alessandro Ordine, Fabio Feuli, Giuseppe Bianchi 0001 |
Multiple-path layer-2 based routing and load balancing approach for wireless infrastructure mesh networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoNEXT ![In: Proceedings of the 2006 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2006, Lisboa, Portugal, December 4-7, 2006, pp. 39, 2006, ACM, 1-59593-456-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim |
Embedding Starlike Trees into Hypercube-Like Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA Workshops ![In: Frontiers of High Performance Computing and Networking - ISPA 2006 Workshops, ISPA 2006 International Workshops, FHPCN, XHPC, S-GRACE, GridGIS, HPC-GTP, PDCE, ParDMCom, WOMP, ISDF, and UPWN, Sorrento, Italy, December 4-7, 2006, Proceedings, pp. 301-310, 2006, Springer, 3-540-49860-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
restricted HL-graphs, path partition, interconnection networks, Spanning trees |
21 | Yuval Emek, David Peleg |
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 261-270, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
21 | Yau-Ming Sun, Chih-Hsueh Yang, Yeh-Ching Chung, Tai-Yi Huang |
An Efficient Deadlock-Free Tree-Based Routing Algorithm for Irregular Wormhole-Routed Networks Based on the Turn Model ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 33rd International Conference on Parallel Processing (ICPP 2004), 15-18 August 2004, Montreal, Quebec, Canada, pp. 343-352, 2004, IEEE Computer Society, 0-7695-2197-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Gary L. Miller, Peter C. Richter |
Lower bounds for graph embeddings and combinatorial preconditioners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain, pp. 112-119, 2004, ACM, 1-58113-840-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
congestion, preconditioning, dilation, graph embeddings |
21 | Atsuko Yamaguchi, Hiroshi Mamitsuka |
Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 58-67, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Jochen Könemann, R. Ravi 0001 |
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings, pp. 289-301, 2003, Springer, 3-540-20680-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Sayaka Kamei, Hirotsugu Kakugawa |
A Self-Stabilizing Algorithm for the Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SRDS ![In: 21st Symposium on Reliable Distributed Systems (SRDS 2002), 13-16 October 2002, Osaka, Japan, pp. 396-, 2002, IEEE Computer Society, 0-7695-1659-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Joseph Naor, Baruch Schieber |
Improved Approximations for Shallow-Light Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 536-541, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
shallow-light spanning trees, bicriteria optimization, non-trivial approximation factors, information retrieval, directed graphs, directed graph, directed graphs, polynomial time algorithm, VLSI design |
21 | Vinaya Revannaswamy, P. C. P. Bhatt |
A Fault Tolerant Protocol As an Extension to a Distributed Mutual Exclusion Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 11-13 December 1997, Seoul, Korea, Proceedings, pp. 730-735, 1997, IEEE Computer Society, 0-8186-8227-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
fault tolerance, distributed algorithms, Computer networks, mutual exclusion, critical section, network partitioning, token passing |
21 | Ting-Hai Chao, Yu-Chin Hsu |
Rectilinear Steiner tree construction by local and global refinement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(3), pp. 303-309, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
20 | Berfin Erdinç, Mahmut Kaya, Ali Senol |
MCMSTStream: applying minimum spanning tree to KD-tree-based micro-clusters to define arbitrary-shaped clusters in streaming data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 36(13), pp. 7025-7042, May 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Ali Senol |
MCMSTClustering: defining non-spherical clusters by using minimum spanning tree over KD-tree-based micro-clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 35(18), pp. 13239-13259, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Andrey Prokopenko, Piyush Sao, Damien Lebrun-Grandié |
A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.00514, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Andrey Prokopenko, Piyush Sao, Damien Lebrun-Grandié |
A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: Proceedings of the 51st International Conference on Parallel Processing, ICPP 2022, Bordeaux, France, 29 August 2022 - 1 September 2022, pp. 14:1-14:10, 2022, ACM, 978-1-4503-9733-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Konstantinos Mastakas |
Drawing a rooted tree as a rooted y-monotone minimum spanning tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 166, pp. 106035, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Konstantinos Mastakas |
Drawing a Rooted Tree as a Rooted y-Monotone Minimum Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1806.04720, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
20 | Akio Fujiyoshi |
A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 28(5), pp. 563-582, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Sravan Danda, Aditya Challa, B. S. Daya Sagar, Laurent Najman |
Power Tree Filter: A Theoretical Framework Linking Shortest Path Filters and Minimum Spanning Tree Filters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Mathematical Morphology and Its Applications to Signal and Image Processing - 13th International Symposium, ISMM 2017, Fontainebleau, France, May 15-17, 2017, Proceedings, pp. 199-210, 2017, 978-3-319-57239-0. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Jakob Bossek, Christian Grimme |
A pareto-beneficial sub-tree mutation for the multi-criteria minimum spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSCI ![In: 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017, Honolulu, HI, USA, November 27 - Dec. 1, 2017, pp. 1-8, 2017, IEEE, 978-1-5386-2726-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Akio Fujiyoshi |
A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata - 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings, pp. 101-112, 2016, Springer, 978-3-319-40945-0. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Dongwoo Kwon, Hongtaek Ju |
A media distribution tree construction method using a maximum spanning tree for mobile smart devices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APNOMS ![In: 17th Asia-Pacific Network Operations and Management Symposium, APNOMS 2015, Busan, South Korea, August 19-21, 2015, pp. 227-231, 2015, IEEE, 978-4-8855-2296-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Linchao Bao, Yibing Song, Qingxiong Yang, Hao Yuan, Gang Wang 0012 |
Tree Filtering: Efficient Structure-Preserving Smoothing With a Minimum Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 23(2), pp. 555-569, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Genya Ishigaki, Masao Yoshida, Norihiko Shinomiya |
On maximizing tree reliability based on minimum diameter spanning tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APCCAS ![In: 2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014, Ishigaki, Japan, November 17-20, 2014, pp. 603-606, 2014, IEEE, 978-1-4799-5230-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer |
Drawing a tree as a minimum spanning tree approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 78(2), pp. 491-503, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Luis Eduardo Neves Gouveia, Luidi Simonetti, Eduardo Uchoa |
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 128(1-2), pp. 123-148, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
20 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer |
Drawing a Tree as a Minimum Spanning Tree Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC (2) ![In: Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II, pp. 61-72, 2010, Springer, 978-3-642-17513-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Daniel Raible 0001, Henning Fernau |
An Amortized Search Tree Analysis for k-Leaf Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings, pp. 672-684, 2010, Springer, 978-3-642-11265-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | David S. Planeta |
Linear Time Algorithms Based on Multilevel Prefix Tree for Finding Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0708.3408, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
20 | Gengui Zhou, Zhiqing Meng, Zhenyu Cao, Jian Cao |
A New Tree Encoding for the Degree-Constrained Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS ![In: Computational Intelligence and Security, International Conference, CIS 2007, Harbin, Heilongjiang, China, December 15-19, 2007, pp. 85-90, 2007, IEEE Computer Society, 0-7695-3072-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin, Mohamed Haouari |
Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Exp. Theor. Artif. Intell. ![In: J. Exp. Theor. Artif. Intell. 15(1), pp. 103-112, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Young C. Wee, Seth Chaiken, S. S. Ravi |
Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 12(6), pp. 421-435, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
20 | Ying Teh Tsai, Chuan Yi Tang |
The Competitiveness of Randomized Algorithms for On-Line Steiner Tree and On-Line Spanning Tree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 48(4), pp. 177-182, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
20 | Jan-Ming Ho, Gopalakrishnan Vijayan, Chak-Kuen Wong |
Constructing the optimal rectilinear Steiner tree derivable from a minimum spanning tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 1989 IEEE International Conference on Computer-Aided Design, ICCAD 1989, Santa Clara, CA, USA, November 5-9, 1989. Digest of Technical Papers, pp. 6-9, 1989, IEEE Computer Society, 0-8186-1986-4. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
20 | Petr Kovár, Michael Kubesa |
Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 334-344, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Franz Rothlauf, Carsten Tzschoppe |
Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoCOP ![In: Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings, pp. 202-212, 2005, Springer, 3-540-25337-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Xiang-Yang Li 0001, Yu Wang 0003 |
Efficient Construction of Low Weight Bounded Degree Planar Spanner. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 374-384, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Yuh-Shyan Chen, Tong-Ying Juang, Ying-Ying Shen |
Multi-Node Broadcasting in an Arrangement Graph Using Multiple Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: Seventh International Conference on Parallel and Distributed Systems, ICPADS 2000, Iwate, Japan, July 4-7, 2000, pp. 213-220, 2000, IEEE Computer Society, 0-7695-0568-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
routing, parallel processing, interconnection network, broadcast, Arrangement graph |
19 | Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis |
A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, pp. 133-148, 2009, Springer, 978-3-642-05117-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Byoungyong Lee, Kyungseo Park, Ramez Elmasri |
Reducing Energy Consumption through the Union of Disjoint Set Forests Algorithm in Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICOIN ![In: Information Networking. Towards Ubiquitous Networking and Services, International Conference, ICOIN 2007, Estoril, Portugal, January 23-25, 2007. Revised Selected Papers, pp. 594-603, 2007, Springer, 978-3-540-89523-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Daniel Archambault, Tamara Munzner, David Auber |
Smashing Peacocks Further: Drawing Quasi-Trees from Biconnected Components. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 12(5), pp. 813-820, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Graph and Network Visualization, Quasi-Tree |