Skip to main content
SpringerLink
Log in

Parametric problems on graphs of bounded tree-width

  • Conference paper
  • First Online:
Algorithm Theory — SWAT '92 (SWAT 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 621))

Included in the following conference series:

Abstract

We consider optimization problems on weighted graphs where vertex and edge weights are polynomial functions of a parameter λ. We show that, if a problem satisfies certain regularity properties and the underlying graph has bounded tree-width, the number of changes in the optimum solution is polynomially bounded. We also show that the description of the sequence of optimum solutions can be constructed in polynomial time and that certain parametric search problems can be solved in O(n log n) time, where n is the number of vertices in the graph.

Supported in part by the National Science Foundation under grant No. CCR-8909626.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discr. Appl. Math., 23:11–24 (1989).

    Google Scholar 

  2. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308–340.

    Google Scholar 

  3. M. Atallah. Dynamic computational geometry. Comp. & Maths. with Appls., 11(12):1171–1181, 1985.

    Google Scholar 

  4. M.W. Bern, E.L. Lawler, and A.L. Wong. Linear time computation of optimal subgraphs of decomposable graphs. J. Algorithms, 8:216–235, 1987.

    Google Scholar 

  5. R.B. Borie, R.G. Parker, and C.A. Tovey. Automatic generation of linear-time algorithms from predicate-calculus descriptions of problems on recursively-constructed graph families. Manuscript, 1988. To appear in Algorithmica.

    Google Scholar 

  6. H.L. Bodlaender. Dynamic programming on graphs with bounded tree-width. Technical Report RUU-CS-88-4, University of Utrecht, 1988. Extended Abstract in Proceedings of ICALP88.

    Google Scholar 

  7. P. Carstensen. Complexity of some parametric integer and network programming problems. Math. Programming, 26:64–75, 1983.

    Google Scholar 

  8. R. Cole. Slowing down sorting networks to obtain faster sorting algorithms. J. Assoc. Comput. Mach., 34(1):200–208, 1987.

    Google Scholar 

  9. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12–75, 1990.

    Google Scholar 

  10. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, Mass., 1990.

    Google Scholar 

  11. D. Fernández-Baca and G. Slutzki. Solving parametric problems on trees. J. Algorithms, 10:381–402 (1989).

    Google Scholar 

  12. D. Fernández-Baca and A. Medepalli. Parametric module allocation on partial k-trees. Technical Report 90-25, Department of Computer Science, Iowa State University, December 1990.

    Google Scholar 

  13. M.L. Fisher. The Lagrangian relaxation method for solving integer programming problems. Management Science, 27:1–18 (1981).

    Google Scholar 

  14. G. Gallo, M.D. Grigoriades, and R.E. Tarjan. A fast parametric maximum flow algorithm and its applications. SIAM J. Computing, 18(1):30–55, 1989.

    Google Scholar 

  15. D. Gusfield. Parametric combinatorial computing and a problem in program module allocation. J. Assoc. Comput. Mach., 30(3):551–563, July 1983.

    Google Scholar 

  16. C.P.M. van Hoesel, A.W.J. Kolen, A.H.G. Rinooy and A.P.M. Wagelmans, Sensitivity analysis in combinatorial optimization: a bibliography. Report 8944/A, Econometric Institute, Erasmus University Rotterdam, 1989.

    Google Scholar 

  17. M. Garey and D. Johnson. Computers and Intractability: A Guide to the theory of NP-Completeness. Freeman, San Francisco, 1979.

    Google Scholar 

  18. J. Lagergren. Algorithms and minimal forbidden minors for tree-decomposable graphs. (Doctoral Dissertation) Technical Report TRITA-NA-9104, Royal Institute of Technology, Sweden, March 1991.

    Google Scholar 

  19. J. Matoušek and R. Thomas. Algorithms finding tree-decompositions of graphs. J. Algorithms, 12:1–22 (1991).

    Google Scholar 

  20. N. Megiddo. Combinatorial optimization with rational objective functions. Math. Oper. Res., 4:414–424 (1979).

    Google Scholar 

  21. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. Assoc. Comput. Mach., 30(4):852–865, 1983.

    Google Scholar 

  22. K. Murty. Computational complexity of parametric linear programming. Math. Programming, 19:213–219, 1980.

    Google Scholar 

  23. B.A. Reed. Finding approximate separators and computing tree width quickly. To appear in STOC 92.

    Google Scholar 

  24. N. Robertson and P.D. Seymour. Graph minors II: Algorithmic aspects of treewidth. J. Algorithms, 7:309–322, 1986.

    Google Scholar 

  25. N. Robertson and P.D. Seymour. Graph minors XIII: The disjoint paths problem. To appear.

    Google Scholar 

  26. J. van Leeuwen. Graph Algorithms. In J. van Leeuwen (ed.) Handbook of Theoretical Computer Science, MIT Press, Cambridge, Mass., 1990.

    Google Scholar 

  27. T.V. Wimer. Linear algorithms on k-terminal graphs. Ph.D. Thesis, Report No. URI-030, Clemson University (1987).

    Google Scholar 

  28. B. Zhu and W. Goddard. An algorithm for outerplanar graphs with parameter. J. Algorithms, 12:6657–662 (1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Iowa State University, 50011, Ames, IA

    David Fernández-Baca & Giora Slutzki

Authors
  1. David Fernández-Baca
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giora Slutzki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Otto Nurmi Esko Ukkonen

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernández-Baca, D., Slutzki, G. (1992). Parametric problems on graphs of bounded tree-width. In: Nurmi, O., Ukkonen, E. (eds) Algorithm Theory — SWAT '92. SWAT 1992. Lecture Notes in Computer Science, vol 621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55706-7_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-55706-7_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55706-7

  • Online ISBN: 978-3-540-47275-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation