The algorithmic theory of treewidth-Reference-Cited by-同舟云学术

The algorithmic theory of treewidth

Published:2000-07 Issue: Volume:5 Page:27-30
ISSN:1571-0653
Container-title:Electronic Notes in Discrete Mathematics
language:en
Short-container-title:Electronic Notes in Discrete Mathematics

Author:

Bodlaender Hans L.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference11 articles.

1. Abrahamson, K. R., and Fellows, M. R. Finite automata, bounded treewidth and well-quasiordering. In Proceedings of the AMS Summer Workshop on Graph Minors, Graph Structure Theory, Contemporary Mathematics vol. 147 (1993), N. Robertson and P. Seymour, Eds., American Mathematical Society, pp. 539-564.

2. Fixed parameter algorithms For planar dominating set and related problems;Alber;To appear in: Proceedings Scandinavian Workshop on Algorithm Theory, SWAT,2000

3. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Alg. Disc. Meth.,1987

4. Approximation algorithms for NP-complete problems on planar graphs;Baker;J. ACM,1994

5. Bodlaender, H. L. Treewidth: Algorithmic techniques and results. In Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS'97, Lecture Notes in Computer Science, volume 1295 (Berlin, 1997), I. Privara and P. Ruzicka, Eds., Springer-Verlag, pp. 19-36.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Structurally parameterized d-scattered set;Discrete Applied Mathematics;2022-02

2. Parameterized Orientable Deletion;Algorithmica;2020-01-25

3. As Time Goes By: Reflections on Treewidth for Temporal Graphs;Treewidth, Kernels, and Algorithms;2020

4. Structural parameters, tight bounds, and approximation for (k,r)-center;Discrete Applied Mathematics;2019-07

5. Structurally Parameterized d-Scattered Set;Graph-Theoretic Concepts in Computer Science;2018