Skip to main content
SpringerLink
Log in

A combinatorial and logical approach to linear-time computability (extended abstract)

  • Polynomial Algorithms
  • Conference paper
  • First Online:
Eurocal '87 (EUROCAL 1987)

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

Included in the following conference series:

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

References

  1. Arnborg S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability — a survey: BIT 25(1985), 2–23

    Google Scholar 

  2. Arnborg S., Corneil D.G., Proskurowski A.: Complexity of finding embeddings in a k-tree: SIAM J. Alg. Disc. Meth. 8 (1987), 277–284

    Google Scholar 

  3. Arnborg S., Lagergren J., Seese D.: What problems are easy for tree-decomposable graphs: to appear

    Google Scholar 

  4. Bern M.W., Lawler E.L., Wong A.L.: Linear-time computations of subgraphs of decomposable graphs: J. Alg. 8 (1987), 216–235

    Google Scholar 

  5. Corneil D.G., Keil J.M.: A dynamic programming approach to the dominating set problem on k-trees: SIAM J. Alg. Disc. Meth. 8 (1987), 535–543

    Google Scholar 

  6. Johnson D.S.: The NP-completeness column: an ongoing guide: J. Algorithms 6 (1985), 434–451

    Article  Google Scholar 

  7. Robertson N., Seymour P.D.: Graph minors. II. Algorithmic aspects of tree-width: J. Algorithms 7 (1986), 309–322

    Article  Google Scholar 

  8. Robertson N., Seymour P.D.: Graph minors. V. Excluding a planar graph: J. Comb. Th. B 41 (1986), 92–114

    Article  Google Scholar 

  9. Scheffler P.: Dynamic programming algorithms for tree-decomposition problems: AdW der DDR, K.-Weierstraß-Inst. für Mathematik, Berlin 1986 (P-MATH-28/86)

    Google Scholar 

  10. Scheffler P.: Linear-time algorithms for NP-complete problems restricted to partial k-trees: AdW der DDR, K.-Weierstraß-Inst. für Mathematik, Berlin 1987 (R-MATH-03/87)

    Google Scholar 

  11. Seese D.: Tree-partite graphs and the complexity of algorithms: AdW der DDR, Karl-Weierstraß-Institut für Mathematik, Berlin 1986 (P-MATH-8/86)

    Google Scholar 

  12. Takamizawa K., Nishizeki T., Saito N.: Linear-time computability of combinatorial problems on series-parallel graphs: J. ACM 29 (1982), 623–641

    Article  Google Scholar 

  13. Wimer T.V., Hedetniemi S.T.: K-teminal recursive families of graphs: Technical Report 86-May-6

    Google Scholar 

  14. Wimer T.V., Hedetniemi S.T., Laskar R.: A methodology for constructing linear graph algorithms: Congr. Numer. 50 (1985), 43–60

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AdW der DDR, Karl-Weierstraß-Institut für Mathematik, Mohrenstraße 39, DDR-1086, Berlin

    P. Scheffler & D. Seese

Authors
  1. P. Scheffler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Seese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

James H. Davenport

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Scheffler, P., Seese, D. (1989). A combinatorial and logical approach to linear-time computability (extended abstract). In: Davenport, J.H. (eds) Eurocal '87. EUROCAL 1987. Lecture Notes in Computer Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51517-8_142

Download citation

  • DOI: https://doi.org/10.1007/3-540-51517-8_142

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51517-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation