Search Results

There are 12194 results for: content related to: Balancing two spanning trees

  1. Completely independent spanning trees in torus networks

    Networks

    Volume 60, Issue 1, August 2012, Pages: 59–69, Toru Hasunuma and Chie Morisaka

    Article first published online : 16 SEP 2011, DOI: 10.1002/net.20460

  2. On building multiple spanning trees and VLAN assignment in metro ethernet networks

    Networks

    Volume 61, Issue 3, May 2013, Pages: 263–280, Aref Meddeb

    Article first published online : 20 JUL 2012, DOI: 10.1002/net.21477

  3. Dirac's Condition for Completely Independent Spanning Trees

    Journal of Graph Theory

    Volume 77, Issue 3, November 2014, Pages: 171–179, Toru Araki

    Article first published online : 13 DEC 2013, DOI: 10.1002/jgt.21780

  4. An effective algorithm for computing all-terminal reliability bounds

    Networks

    Volume 66, Issue 4, December 2015, Pages: 282–295, Jaime Silva, Teresa Gomes, David Tipper, Lúcia Martins and Velin Kounev

    Article first published online : 31 AUG 2015, DOI: 10.1002/net.21634

  5. Efficient Edge-swapping heuristics for the reload cost spanning tree problem

    Networks

    Volume 65, Issue 4, July 2015, Pages: 380–394, S. Raghavan and Mustafa Sahin

    Article first published online : 20 MAR 2015, DOI: 10.1002/net.21609

  6. Sharp threshold for the appearance of certain spanning trees in random graphs

    Random Structures & Algorithms

    Volume 41, Issue 4, December 2012, Pages: 391–412, Dan Hefetz, Michael Krivelevich and Tibor Szabó

    Article first published online : 5 OCT 2012, DOI: 10.1002/rsa.20472

  7. Reload cost trees and network design

    Networks

    Volume 59, Issue 4, July 2012, Pages: 365–379, Ioannis Gamvros, Luis Gouveia and S. Raghavan

    Article first published online : 1 AUG 2011, DOI: 10.1002/net.20443

  8. The number of spanning trees in an (r, s)-semiregular graph and its line graph

    International Journal of Quantum Chemistry

    Volume 113, Issue 8, 15 April 2013, Pages: 1209–1212, Khodakhast Bibak

    Article first published online : 26 JUN 2012, DOI: 10.1002/qua.24252

  9. Generalized loop-erased random walks and approximate reachability

    Random Structures & Algorithms

    Volume 44, Issue 2, March 2014, Pages: 201–223, Igor Gorodezky and Igor Pak

    Article first published online : 6 DEC 2012, DOI: 10.1002/rsa.20460

  10. Submodularity of minimum-cost spanning tree games

    Networks

    Volume 63, Issue 3, May 2014, Pages: 231–238, Masayuki Kobayashi and Yoshio Okamoto

    Article first published online : 27 JAN 2014, DOI: 10.1002/net.21540

  11. Formulations and exact solution approaches for the degree preserving spanning tree problem

    Networks

    Volume 65, Issue 4, July 2015, Pages: 329–343, Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena and Bernard Gendron

    Article first published online : 11 MAR 2015, DOI: 10.1002/net.21590

  12. Diameter of random spanning trees in a given graph

    Journal of Graph Theory

    Volume 69, Issue 3, March 2012, Pages: 223–240, Fan Chung, Paul Horn and L. Lu

    Article first published online : 4 MAR 2011, DOI: 10.1002/jgt.20577

  13. Interpolation theorem for the number of end-vertices of spanning trees

    Journal of Graph Theory

    Volume 7, Issue 2, Summer 1983, Pages: 203–208, Seymour Schuster

    Article first published online : 3 OCT 2006, DOI: 10.1002/jgt.3190070209

  14. On graphs with the maximum number of spanning trees

    Random Structures & Algorithms

    Volume 9, Issue 1-2, August - September 1996, Pages: 177–192, Alexander K. Kelmans

    Article first published online : 7 DEC 1998, DOI: 10.1002/(SICI)1098-2418(199608/09)9:1/2<177::AID-RSA11>3.0.CO;2-L

  15. Two-graph analysis of pathological equivalent networks

    International Journal of Circuit Theory and Applications

    Volume 43, Issue 9, September 2015, Pages: 1127–1146, Guoyong Shi

    Article first published online : 25 APR 2014, DOI: 10.1002/cta.1997

  16. A good algorithm for smallest spanning trees with a degree constraint

    Networks

    Volume 8, Issue 3, Autumn (Fall) 1978, Pages: 201–208, H. N. Gabow

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230080304

  17. A linear programming approach to increasing the weight of all minimum spanning trees

    Networks

    Volume 52, Issue 4, December 2008, Pages: 227–234, Mourad Baïou and Francisco Barahona

    Article first published online : 25 FEB 2008, DOI: 10.1002/net.20242

  18. Minimum Spanning Trees

    Standard Article

    Wiley Encyclopedia of Operations Research and Management Science

    Ashish K. Nemani and Ravindra K. Ahuja

    Published Online : 15 FEB 2011, DOI: 10.1002/9780470400531.eorms0816

  19. Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations

    International Transactions in Operational Research

    Volume 19, Issue 3, May 2012, Pages: 323–352, Ana Maria de Almeida, Pedro Martins and Maurício C. de Souza

    Article first published online : 13 OCT 2011, DOI: 10.1111/j.1475-3995.2011.00830.x

  20. Classification of interpolation theorems for spanning trees and other families of spanning subgraphs

    Journal of Graph Theory

    Volume 13, Issue 6, December 1989, Pages: 703–712, Frank Harary and Michael J. Plantholt

    Article first published online : 5 OCT 2006, DOI: 10.1002/jgt.3190130606