Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results

  • Articles
  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

We present anO(p · n) algorithm for the problem of finding disjoint simple paths of minimum total length betweenp given pairs of terminals on oriented partial 2-trees withn nodes and positive or negative arc lengths. The algorithm is inO(n) if all terminals are distinct nodes. We characterize the convex hull of the feasible solution set for the casep=2.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arnborg S, Proskurowski A (1986) Characterization and recognition of partial 3-trees. SIAM J Alg Disc Meth 7:303–340

    Google Scholar 

  2. Arnborg S, Proskurowski A (1989) Linear time algorithms forNP-hard problems restricted to partialk-trees. Discrete Appl Math 23:11–24

    Google Scholar 

  3. Bern W, Lawler EL, Wong L (1987) Linear time computation of optimal subgraphs of decomposable graphs. J of Algorithms 8:216–235

    Google Scholar 

  4. Bodlaender HL (1993) A linear time algorithm for finding tree-decompositions of small treewidth. Proc 25th STOC 226–234

  5. Fortune S, Hopcroft J, Wyllie J (1980) The directed subgraph homeomorphism problem. Theoret Comput Sci 10, 2:111–121

    Google Scholar 

  6. Karp RM (1975) On the complexity of combinatorial problems. Networks 5:45–68

    Google Scholar 

  7. Margot F (1987) Chemins disjoints sur un 2-arbre. Diploma thesis, EPF Lausanne

  8. Martin RK, Rardin RL, Campbell BA (1990) Polyhedral characterization of discrete dynamic programming. Operations Research 38:127–138

    Google Scholar 

  9. Matousek J, Thomas R (1988) On the complexity of finding iso- and other morphisms for partialk-trees. Working paper

  10. Pearl Y, Shiloach Y (1978) Finding two disjoint paths between two pairs of vertices in a graph. J of the ACM 25, 1:1–9

    Google Scholar 

  11. Robertson N, Seymour PD (1985) Graph minors — A survey. London Mathematical Society Lecture Note Series 103, Cambridge University Press 153–171

  12. Robertson N, Seymour PD (1988) An outline of a disjoint paths algorithm. Preprint

  13. Scheffler P (1988) Linear-time algorithms for graphs of bounded tree-width. The DISJOINTPATHS-problem. In: Graphentheorie und ihre Anwendungen, Stadt Wehlen 1988, PH Dresden, Dresd Reihe Forsch 5, 9:49–52

    Google Scholar 

  14. Shiloach Y (1980) A polynomial solution to the undirected two paths problem. J of the ACM 27, 3:445–456

    Google Scholar 

  15. Wald A, Colbourn CJ (1983) Steiner trees, partial 2-trees, and minimum IFI networks. Networks 13:159–167

    Google Scholar 

  16. Wimer TV, Hedetniemi ST, Laskar R (1985) A methodology for constructing linear graph algorithms. Congr Numerantium 50:43–60

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de mathématiques, EPF Lausanne, 1015, Lausanne, Switzerland

    F. Margot, A. Prodon & Th. M. Liebling

Authors
  1. F. Margot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Prodon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Th. M. Liebling
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

We gratefully acknowledge the referee's many helpful suggestions to improve the presentation of this paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Margot, F., Prodon, A. & Liebling, T.M. Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results. ZOR - Methods and Models of Operations Research 41, 325–346 (1995). https://doi.org/10.1007/BF01432363

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation