References
Arnborg S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability — a survey: BIT 25(1985), 2–23
Arnborg S., Corneil D.G., Proskurowski A.: Complexity of finding embeddings in a k-tree: SIAM J. Alg. Disc. Meth. 8 (1987), 277–284
Arnborg S., Lagergren J., Seese D.: What problems are easy for tree-decomposable graphs: to appear
Bern M.W., Lawler E.L., Wong A.L.: Linear-time computations of subgraphs of decomposable graphs: J. Alg. 8 (1987), 216–235
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
Johnson D.S.: The NP-completeness column: an ongoing guide: J. Algorithms 6 (1985), 434–451
Robertson N., Seymour P.D.: Graph minors. II. Algorithmic aspects of tree-width: J. Algorithms 7 (1986), 309–322
Robertson N., Seymour P.D.: Graph minors. V. Excluding a planar graph: J. Comb. Th. B 41 (1986), 92–114
Scheffler P.: Dynamic programming algorithms for tree-decomposition problems: AdW der DDR, K.-Weierstraß-Inst. für Mathematik, Berlin 1986 (P-MATH-28/86)
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)
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)
Takamizawa K., Nishizeki T., Saito N.: Linear-time computability of combinatorial problems on series-parallel graphs: J. ACM 29 (1982), 623–641
Wimer T.V., Hedetniemi S.T.: K-teminal recursive families of graphs: Technical Report 86-May-6
Wimer T.V., Hedetniemi S.T., Laskar R.: A methodology for constructing linear graph algorithms: Congr. Numer. 50 (1985), 43–60
Author information
Authors and Affiliations
Editor information
Rights 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