Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A note on packing paths in planar graphs

  • Published:
Mathematical Programming Submit manuscript

Abstract

Seymour (1981) proved that the cut criterion is necessary and sufficient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, Middendorf and Pfeiffer (1993) proved the problem to be NP-complete. For this case, Korach and Penn (1992) proved that the cut criterion is sufficient for the existence of a near-complete packing of paths. Here we generalize this result by showing how a natural strengthening of the cut criterion yields better packings of paths.

Analogously to Seymour's approach, we actually prove a theorem on packing cuts in an arbitrary graph and then the planar edge-disjoint paths case is obtained by planar dualization. The main result is derived from a theorem of Sebő (1990) on the structure of ±1 weightings of a bipartite graph with no negative circuits.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. Frank, “Packing paths, circuits, and cuts—a survey,” in: B. Korte, L. Lovász, H.-J. Prömel and A. Schrijver, eds.,Paths, Flows and VLSI-Layouts (Springer, Berlin, 1990) pp. 47–100.

    Google Scholar 

  2. M. Guan, “Graphic programming using odd and even points,”Chinese Journal of Mathematics 1 (1962) 273–277.

    Google Scholar 

  3. E. Korach and M. Penn, “Tight integral duality gap in the Chinese postman problem,”Mathematical Programming 55 (1992) 183–191.

    Google Scholar 

  4. M. Middendorf and F. Pfeiffer, “On the complexity of the edge-disjoint paths problem,”Combinatorica 13 (1) (1993) 97–108.

    Google Scholar 

  5. A. Sebő, “Undirected distances and the postman-structure of graphs,”Journal of Combinatorial Theory. Series B 49 (1) (1990) 10–39.

    Google Scholar 

  6. A, Sebő, “Potentials in undirected graphs and planar multiflows,”SIAM Journal on Computing, to appear.

  7. P.D. Seymour, “On odd cuts and planar multicommodity flows,”Proceedings of the London Mathematical Society (3) 42 (1981) 178–192.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research partially supported by the Hungarian National Foundation for Scientific Research Grants OTKA 2118 and 4271.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Frank, A., Szigeti, Z. A note on packing paths in planar graphs. Mathematical Programming 70, 201–209 (1995). https://doi.org/10.1007/BF01585937

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01585937

Keywords