Search Results

There are 10512 results for: content related to: Independent spanning trees on folded hyper-stars

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

    Networks

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

    Version of Record online : 20 JUL 2012, DOI: 10.1002/net.21477

  2. Completely independent spanning trees in torus networks

    Networks

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

    Version of Record online : 16 SEP 2011, DOI: 10.1002/net.20460

  3. Supereulerian graphs: A survey

    Journal of Graph Theory

    Volume 16, Issue 2, June 1992, Pages: 177–196, Paul A. Catlin

    Version of Record online : 5 OCT 2006, DOI: 10.1002/jgt.3190160209

  4. 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

  5. You have free access to this content
    Multicriteria path and tree problems: discussion on exact algorithms and applications

    International Transactions in Operational Research

    Volume 19, Issue 1-2, January / March 2012, Pages: 63–98, João C. N. Clímaco and Marta M. B. Pascoal

    Version of Record online : 27 FEB 2013, DOI: 10.1111/j.1475-3995.2011.00815.x

  6. Minimax flow tree problems

    Networks

    Volume 54, Issue 3, October 2009, Pages: 117–129, Hui Chen, Ann Campbell, Barrett Thomas and Arie Tamir

    Version of Record online : 6 MAR 2009, DOI: 10.1002/net.20313

  7. Network design for time-constrained delivery

    Naval Research Logistics (NRL)

    Volume 55, Issue 6, September 2008, Pages: 493–515, Hui Chen, Ann Melissa Campbell and Barrett W. Thomas

    Version of Record online : 21 JUL 2008, DOI: 10.1002/nav.20302

  8. Lower and upper bounds for the degree-constrained minimum spanning tree problem

    Networks

    Volume 50, Issue 1, August 2007, Pages: 55–66, Alexandre Salles da Cunha and Abilio Lucena

    Version of Record online : 30 APR 2007, DOI: 10.1002/net.20166

  9. A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem

    Networks

    Volume 35, Issue 1, January 2000, Pages: 1–16, Luis Gouveia and Pedro Martins

    Version of Record online : 15 DEC 1999, DOI: 10.1002/(SICI)1097-0037(200001)35:1<1::AID-NET1>3.0.CO;2-L

  10. 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

    Version of Record online : 13 OCT 2011, DOI: 10.1111/j.1475-3995.2011.00830.x

  11. Design of Survivable Networks: A survey

    Networks

    Volume 46, Issue 1, August 2005, Pages: 1–21, Hervé Kerivin and A. Ridha Mahjoub

    Version of Record online : 13 JUN 2005, DOI: 10.1002/net.20072

  12. You have free access to this content
    References

    Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, Second Edition

    Atsuyuki Okabe, Barry Boots, Kokichi Sugihara, Sung Nok Chiu, D. G. Kendall, Pages: 585–655, 2008

    Published Online : 27 MAY 2008, DOI: 10.1002/9780470317013.refs

  13. Boundary Spanning in Global Organizations

    Journal of Management Studies

    Andreas P. J. Schotter, Ram Mudambi, Yves L. Doz and Ajai Gaur

    Version of Record online : 16 JAN 2017, DOI: 10.1111/joms.12256

  14. You have free access to this content
    General Bibliography

    Paradigms of Combinatorial Optimization, 2nd Edition

    Vangelis Th. Paschos, Pages: 707–765, 2014

    Published Online : 8 AUG 2014, DOI: 10.1002/9781119005353.biblio

  15. Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem

    Networks

    Volume 59, Issue 1, January 2012, Pages: 148–160, Eduardo Uchoa, Túlio A. M. Toffolo, Mauricio C. de Souza, Alexandre X. Martins and Ricardo Fukasawa

    Version of Record online : 29 NOV 2011, DOI: 10.1002/net.20485

  16. A note on genetic algorithms for degree-constrained spanning tree problems

    Networks

    Volume 30, Issue 2, September 1997, Pages: 91–95, Gengui Zhou and Mitsuo Gen

    Version of Record online : 7 DEC 1998, DOI: 10.1002/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F

  17. Comparison of metaheuristics for the k-labeled spanning forest problem

    International Transactions in Operational Research

    Volume 24, Issue 3, May 2017, Pages: 559–582, Sergio Consoli, José Andrés Moreno Pérez and Nenad Mladenović

    Version of Record online : 20 NOV 2015, DOI: 10.1111/itor.12217

  18. A reduction method to find spanning Eulerian subgraphs

    Journal of Graph Theory

    Volume 12, Issue 1, Spring 1988, Pages: 29–44, Paul A. Catlin

    Version of Record online : 5 OCT 2006, DOI: 10.1002/jgt.3190120105

  19. Scaling limits for minimal and random spanning trees in two dimensions

    Random Structures & Algorithms

    Volume 15, Issue 3-4, October - December 1999, Pages: 319–367, Michael Aizenman, Almut Burchard, Charles M. Newman and David B. Wilson

    Version of Record online : 20 OCT 1999, DOI: 10.1002/(SICI)1098-2418(199910/12)15:3/4<319::AID-RSA8>3.0.CO;2-G

  20. Minimum bottleneck spanning trees with degree bounds

    Networks

    Volume 68, Issue 4, December 2016, Pages: 302–314, Patrick J. Andersen and Charl J. Ras

    Version of Record online : 30 SEP 2016, DOI: 10.1002/net.21710