Search Results

There are 39467 results for: content related to: Locating median paths on connected outerplanar graphs

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

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

  6. Constructions of small regular bipartite graphs of girth 6

    Networks

    Volume 57, Issue 2, March 2011, Pages: 121–127, G. Araujo-Pardo and Camino Balbuena

    Version of Record online : 29 JUN 2010, DOI: 10.1002/net.20392

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

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

  9. Exact algorithms for the vertex separator problem in graphs

    Networks

    Volume 57, Issue 3, May 2011, Pages: 212–230, Cid C. de Souza and Victor F. Cavalcante

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

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

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

  12. Lagrangean decomposition/relaxation for the routing and wavelength assignment problem

    Networks

    Volume 59, Issue 2, March 2012, Pages: 226–239, Babacar Thiongane

    Version of Record online : 16 MAY 2011, DOI: 10.1002/net.20437

  13. Cover inequalities for robust knapsack sets—Application to the robust bandwidth packing problem

    Networks

    Volume 59, Issue 1, January 2012, Pages: 59–72, Olivier Klopfenstein and Dritan Nace

    Version of Record online : 1 DEC 2011, DOI: 10.1002/net.20488

  14. Traffic grooming in bidirectional WDM ring networks

    Networks

    Volume 58, Issue 1, August 2011, Pages: 20–35, Jean-Claude Bermond, Xavier Muñoz and Ignasi Sau

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

  15. Finding integer efficient solutions for multiple objective network programming problems

    Networks

    Volume 57, Issue 4, July 2011, Pages: 362–375, Minghe Sun

    Version of Record online : 1 OCT 2010, DOI: 10.1002/net.20407

  16. Minimax regret path location on trees

    Networks

    Volume 58, Issue 2, September 2011, Pages: 147–158, Justo Puerto, Federica Ricca and Andrea Scozzari

    Version of Record online : 2 AUG 2011, DOI: 10.1002/net.20453

  17. Uncertainty feature optimization: An implicit paradigm for problems with noisy data

    Networks

    Volume 57, Issue 3, May 2011, Pages: 270–284, Niklaus Eggenberg, Matteo Salani and Michel Bierlaire

    Version of Record online : 3 FEB 2011, DOI: 10.1002/net.20428

  18. The preemptive swapping problem on a tree

    Networks

    Volume 58, Issue 2, September 2011, Pages: 83–94, Shoshana Anily, Michel Gendreau and Gilbert Laporte

    Version of Record online : 2 AUG 2011, DOI: 10.1002/net.20451

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

  20. Coverings and matchings in r-partite hypergraphs

    Networks

    Volume 59, Issue 4, July 2012, Pages: 400–410, Douglas S. Altner and J. Paul Brooks

    Version of Record online : 27 MAR 2012, DOI: 10.1002/net.20459