Search Results

There are 38555 results for: content related to: Constructions of small regular bipartite graphs of girth 6

  1. Graph labelings derived from models in distributed computing: A complete complexity classification

    Networks

    Volume 58, Issue 3, October 2011, Pages: 207–231, Jérémie Chalopin and Daniël Paulusma

    Version of Record online : 10 MAR 2011, DOI: 10.1002/net.20432

  2. Survivability in hierarchical telecommunications networks

    Networks

    Volume 59, Issue 1, January 2012, Pages: 37–58, Pierre Fouilhoux, Oya Ekin Karasan, A. Ridha Mahjoub, Onur Özkök and Hande Yaman

    Version of Record online : 25 NOV 2011, DOI: 10.1002/net.20479

  3. Optimal online ring routing

    Networks

    Volume 57, Issue 2, March 2011, Pages: 187–197, Jessen T. Havill and Kevin R. Hutson

    Version of Record online : 30 JUL 2010, DOI: 10.1002/net.20400

  4. Complexity of column generation in network design with path-based survivability mechanisms

    Networks

    Volume 59, Issue 1, January 2012, Pages: 132–147, Sebastian Orlowski and Michał Pióro

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

  5. On cut-based inequalities for capacitated network design polyhedra

    Networks

    Volume 57, Issue 2, March 2011, Pages: 141–156, Christian Raack, Arie M.C.A. Koster, Sebastian Orlowski and Roland Wessäly

    Version of Record online : 30 JUN 2010, DOI: 10.1002/net.20395

  6. Earliest arrival flows on series-parallel graphs

    Networks

    Volume 57, Issue 2, March 2011, Pages: 169–173, Stefan Ruzika, Heike Sperber and Mechthild Steiner

    Version of Record online : 30 JUL 2010, DOI: 10.1002/net.20398

  7. Locating median paths on connected outerplanar graphs

    Networks

    Volume 57, Issue 3, May 2011, Pages: 294–307, Isabella Lari, Federica Ricca, Andrea Scozzari and Ronald I. Becker

    Version of Record online : 25 MAR 2011, DOI: 10.1002/net.20426

  8. Tolerant identification with Euclidean balls

    Networks

    Volume 61, Issue 3, May 2013, Pages: 212–225, Ville Junnila, Tero Laihonen and Aline Parreau

    Version of Record online : 18 JUL 2012, DOI: 10.1002/net.21472

  9. Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs

    Networks

    Volume 60, Issue 2, September 2012, Pages: 103–119, Siqian Shen and J. Cole Smith

    Version of Record online : 28 OCT 2011, DOI: 10.1002/net.20464

  10. Computation of the optimal value function in time-dependent networks

    Networks

    Volume 62, Issue 2, September 2013, Pages: 105–124, Sebastian Kluge, Konrad Reif and Martin Brokate

    Version of Record online : 2 MAY 2013, DOI: 10.1002/net.21501

  11. A note on Steiner tree games

    Networks

    Volume 59, Issue 2, March 2012, Pages: 215–225, Darko Skorin-Kapov and Jadranka Skorin-Kapov

    Version of Record online : 17 MAR 2011, DOI: 10.1002/net.20436

  12. Affine recourse for the robust network design problem: Between static and dynamic routing

    Networks

    Volume 61, Issue 2, March 2013, Pages: 180–198, Michael Poss and Christian Raack

    Version of Record online : 7 SEP 2012, DOI: 10.1002/net.21482

  13. A branch-and-cut algorithm for the preemptive swapping problem

    Networks

    Volume 59, Issue 4, July 2012, Pages: 387–399, Charles Bordenave, Michel Gendreau and G. Laporte

    Version of Record online : 30 SEP 2011, DOI: 10.1002/net.20447

  14. Recoverable robust shortest path problems

    Networks

    Volume 59, Issue 1, January 2012, Pages: 181–189, Christina Büsing

    Version of Record online : 25 NOV 2011, DOI: 10.1002/net.20487

  15. On terminal delta-wye reducibility of planar graphs

    Networks

    Volume 57, Issue 2, March 2011, Pages: 174–186, Isidoro Gitler and Feliú Sagols

    Version of Record online : 30 JUL 2010, DOI: 10.1002/net.20399

  16. Edge-superconnectivity of semiregular cages with odd girth

    Networks

    Volume 58, Issue 3, October 2011, Pages: 201–206, C. Balbuena, D. González-moreno and J. Salas

    Version of Record online : 10 MAR 2011, DOI: 10.1002/net.20431

  17. Exactly solving a two-level location problem with modular node capacities

    Networks

    Volume 59, Issue 1, January 2012, Pages: 161–180, Bernardetta Addis, Giuliana Carello and Alberto Ceselli

    Version of Record online : 25 NOV 2011, DOI: 10.1002/net.20486

  18. Complexity of a classical flow restoration problem

    Networks

    Volume 62, Issue 2, September 2013, Pages: 149–160, Dritan Nace, Michał Pióro, Artur Tomaszewski and Mateusz Żotkiewicz

    Version of Record online : 28 MAY 2013, DOI: 10.1002/net.21508

  19. Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment

    Networks

    Volume 59, Issue 2, March 2012, Pages: 191–208, Paolo Serafini and Bruno Simeone

    Version of Record online : 25 MAR 2011, DOI: 10.1002/net.20434

  20. Compression and expansion in graphs using overlays

    Networks

    Volume 58, Issue 1, August 2011, Pages: 36–42, Bilal Khan and Kiran R. Bhutani

    Version of Record online : 22 DEC 2010, DOI: 10.1002/net.20411