Skip to main content
SpringerLink
Log in

Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Recent work in the design of efficient algorithms for optimization problems on treedecomposable graphs concentrates on developing general approaches which lead to families of related algorithms, rather than on developing isolatedad hoc algorithms. This paper develops new general approaches to obtain two new families of related polynomial-time algorithms for (1) packing, partitioning, and covering problems and (2) multiset and multiproperty problems. These problems have not been handled by previous general approaches.

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

Access this article

Log in via an institution

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. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability,BIT,25 (1985), 2–23.

    Google Scholar 

  2. S. Arnborg, D. G. Corneil, and A. Proskurowski, Complexity of finding embeddings in ak-tree,SIAM Journal of Algorithms and Discrete Methods,8 (1987), 277–287.

    Google Scholar 

  3. S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs,Journal of Algorithms,12 (1991), 308–340.

    Google Scholar 

  4. S. Arnborg and A. Proskurowski, Problems on graphs with bounded decomposability,Bulletin of the European Association for Theoretical Computer Science,25 (1985).

  5. S. Arnborg and A. Proskurowski, Characterization and recognition of partialk-trees,SIAM Journal of Algorithms and Discrete Methods,7 (1986), 305–314.

    Google Scholar 

  6. S. Arnborg and S. Proskurowski, Linear time algorithms for NP-hard problems restricted to partialk-trees,Discrete Applied Mathematics,23 (1989), 11–24.

    Google Scholar 

  7. M. Bauderon and B. Courcelle, Graph expressions and graph rewritings,Mathematical Systems Theory,20 (1987), 83–127.

    Google Scholar 

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

    Google Scholar 

  9. H. L. Bodlaender, Dynamic Programming on Graphs with Bounded Tree-Width, Ph.D. Thesis, Massachusetts Institute of Technology (1987).

  10. H. L. Bodlaender, Some classes of graphs with bounded tree width,Bulletin of European Association of Theoretical Computer Scientists,36 (1988).

  11. H. L. Bodlaender, Polynomial algorithms for chromatic index and graph isomorphism on partialk-trees,Journal of Algorithms,11 (1990), 631–643.

    Google Scholar 

  12. R. B. Borie, Recursively Constructed Graph Families: Membership and Linear Algorithms, Ph.D. Thesis, School of Information and Computer Science, Georgia Institute of Technology (1988).

  13. R. B. Borie, R. G. Parker, and C. A. Tovey, Deterministic decomposition of recursive graph classes,SIAM Journal of Discrete Mathematics,4 (1991), 481–501.

    Google Scholar 

  14. 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,Algorithmica,7 (1992), 555–581.

    Google Scholar 

  15. B. Courcelle, Equivalence and transformation of regular systems,Theoretical Computer Science,42 (1986), 1–22.

    Google Scholar 

  16. B. Courcelle, Monadic second-order logic and context-free graph grammars,Symposium on Mathematical Foundations of Computer Science, Springer-Verlag, New York (1989).

    Google Scholar 

  17. B. Courcelle, The monadic second-order logic of graphs,Information and Computation,85 (1990), 12–75.

    Google Scholar 

  18. B. Courcelle, Graph rewriting: an algebraic and logic approach,Handbook of Theoretical Computer Science, Volume B, Elsevier, Amsterdam (1990), pp. 193–242.

    Google Scholar 

  19. B. Courcelle and M. Mosbah, Monadic second-order evaluations on tree-decomposable graphs,Graph-Theoretic Concepts in Computer Science, 17th International Workshop, Springer-Verlag, New York (1991).

    Google Scholar 

  20. E. El-Mallah, Decomposition and Embedding Problems for Restricted Networks, Ph.D. Thesis, University of Waterloo (1987).

  21. E. El-Mallah and C. Colbourn, Partialk-tree algorithms,Proceedings of the 250th Anniversary Conference on Graph Theory (1988), pp. 105–119.

  22. D. L. Grinstead and P. J. Slater, On minimum dominating sets with minimum intersection,Discrete Mathematics,86 (1990), 239–254.

    Google Scholar 

  23. D. L. Grinstead and P. J. Slater, On the minimum intersection of minimal dominating sets in series-parallel graphs,Graph Theory, Combinatorics, and Applications,1 (1991), 563–584.

    Google Scholar 

  24. A. Habel, Hyperedge Replacement Grammars and Languages, Ph.D. Thesis, Bremen University (1989).

  25. A. Habel, H. Kreowski, and W. Vogler, Decidable boundness problems for hyperedge replacement graph grammars,Theoretical Computer Science,89 (1991), 33–62.

    Google Scholar 

  26. E. Hare, S. Hedetniemi, R. Laskar, K. Peters, and T. Wimer, Linear-time computability of combinatorial problems on generalized series-parallel graphs,Discrete Algorithms and Complexity,14 (1987), 437–457.

    Google Scholar 

  27. D. S. Johnson, TheN P-completeness column: an ongoing guide,Journal of Algorithms,6 (1985), 434–451.

    Google Scholar 

  28. J. Lagergren and S. Arnborg, Finding minimal forbidden minors using a finite congruence,Proceedings of ICAL P (1991), pp. 532–543.

  29. P. C. Liu and R. C. Geldmacher, An O(max(m, n)) algorithm for finding a subgraph homeomorphic toK 4,Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory, and Computing (1980), pp. 597–609.

  30. S. Mahajan and J. G. Peters, Algorithms for regular properties in recursive graphs,Proceedings of the 25th Annual Allerton Conference on Communications, Control, and Computing (1987), pp. 14–23.

  31. J. Matousek and R. Thomas, Algorithms finding tree-decompositions of graphs,Journal of Algorithms,12 (1991), 1–22.

    Google Scholar 

  32. J. Matousek and R. Thomas, On the complexity of finding iso- and other morphisms for partialk-trees,Discrete Mathematics,108 (1992), 343–364.

    Google Scholar 

  33. G. Miller and J. Reif, Parallel tree contraction and its applications,Proceedings of the 26th Symposium on Foundations of Computer Science (1985), pp. 478–489.

  34. T. Politof, A Characterization and Efficient Reliability Computation of Δ-Y Reducible Networks, Ph.D. Thesis, University of California, Berkeley (1983).

    Google Scholar 

  35. R. L. Rardin, R. G. Parker, and D. K. Wagner, Definitions, Properties, and Algorithms for Detecting Series-Parallel Graphs, Technical Report, Department of Industrial Engineering, Purdue University (1982).

  36. B. A. Reed, Finding approximate separators and computing tree width quickly,Proceedings of the 24th ACM Symposium on Theory of Computing (1992), pp. 221–228.

  37. M. B. Richey, Combinatorial Optimization on Series-Parallel Graphs: Algorithms and Complexity, Ph.D. Thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology (1985).

  38. M. B. Richey and R. G. Parker, On multiple Steiner subgraph problems,Networks,16 (1986), 423–438.

    Google Scholar 

  39. M. B. Richey and R. G. Parker, Minimum-maximal matching in series-parallel graphs,European Journal of Operations Research,33 (1988), 98–105.

    Google Scholar 

  40. M. B. Richey, R. G. Parker, and R. L. Rardin, An efficiently solvable case of the minimum weight equivalent subgraph problem,Networks,15 (1985), 217–228.

    Google Scholar 

  41. N. Robertson and P. Seymour, Disjoint paths-a survey,SIAM Journal of Algorithms and Discrete Methods,6 (1985), 300–305.

    Google Scholar 

  42. N. Robertson and P. Seymour, Graph minors-a survey inSurveys in Combinatorics, Cambridge University Press, Cambridge (1985), pp. 153–171.

    Google Scholar 

  43. D. P. Sanders, Linear Algorithms for Graphs of Tree-Width at Most Four, Ph.D. Thesis, Georgia Institute of Technology (1993).

  44. P. Scheffler, Linear-Time Algorithms for NP-Complete Problems Restricted to Partialk-Trees, R-MATH-03/87, Akademie der Wissenschaften der DDR (1987).

  45. P. Sheffier and D. Seese, A combinatorial and logical approach to linear-time computability,Proceedings of European Conference on Computer Algebra (1987), pp. 379–380.

  46. D. Seese,Tree-Particle Graphs and the Complexity of Algorithms, Lecture Notes in Computer Science, Volume 199 (1985), Springer-Verlag, Berlin, pp. 412–421.

    Google Scholar 

  47. W. J. Selig and P. J. Slater, Minimum dominating, optimally independent vertex sets in graphs,Graph Theory, Combinatorics, and Applications,2 (1991), 1061–1073.

    Google Scholar 

  48. P. J. Slater, Maximum matching among minimum dominating sets,Ars Combinatorica,35A (1993), 239–249.

    Google Scholar 

  49. K. Takamizawa, T. Nishizeki, and N. Saito, Linear-time computability of combinatorial problems on series-parallel graphs,Journal of the Association for Computing Machinery,29 (1982), 623–641.

    Google Scholar 

  50. J. Valdes, E. Lawler, and R. Tarjan, The recognition of series-parallel digraphs,SIAM Journal of Computing,11 (1982), 289–313.

    Google Scholar 

  51. J. A. Wald and C. J. Colbourn, Steiner trees, partial 2-trees, and minimum IFI networks,Networks,13 (1983), 159–167.

    Google Scholar 

  52. T. V. Wimer, Linear Algorithms onk-Terminal Graphs, Ph.D. Thesis, Report No. URI-030, Clemson University (1987).

  53. T. V. Wimer and S. T. Hedetniemi,K-terminal recursive families of graphs,Proceedings of the 250th Anniversary Conference on Graph Theory (1988), pp. 161–176.

  54. T. V. Wimer, S. T. Hedetniemi, and R. Laskar, A methodology for constructing linear graph algorithms,Congressus Numerantium,50 (1985), 43–60.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Alabama, Box 870290, 35487-0290, Tuscaloosa, AL, USA

    R. B. Borie

Authors
  1. R. B. Borie
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by C. K. Wong.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borie, R.B. Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs. Algorithmica 14, 123–137 (1995). https://doi.org/10.1007/BF01293664

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation