On disjoint cycles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 570 LNCS, Issue , 1992, Pages 230-238

  Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CLASS G; DISJOINT CYCLE; FEEDBACK VERTEX SET; FOLLOWING PROBLEM; GRAPH G; TEST ALGORITHMS; VERTEX-DISJOINT CYCLES;

GRAPH THEORY;

EID: 13644256539     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55121-2_24     Document Type: Conference Paper

References (18)

1. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey. BIT, 25: 2-23, 1985.
2. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. Technical Report 90-02, Laboratoire Bordelais de Recherche en Informatique, Bordeaux, 1990. To appear in Proceedings 4th Workshop on Graph Grammars and Their Applications to Computer Science.
3. S. Arnborg, J. Lagergren, and D. Seese. Problems easy for tree-decomposable graphs (extended abstract). In Proceedings of the 15‘th International Colloquium on Automata, Languages and Programming, pages 38-51. Springer Verlag, Lect. Notes in Comp. Sc. 317, 1988. To appear in J. of Algorithms.
4. H. L. Bodlaender. Classes of graphs with bounded treewidth. Technical Report RUU-CS-86-22, Dept. of Computer Science, Utrecht University, Utrecht, 1986.
5. H. L. Bodlaender. NC-algorithms for graphs with small treewidth. In J. van Leeuwen, editor, Proc. Workshop on Graph-Theoretic Concepts in Computer Science WG’88, pages 1-10. Springer Verlag, LNCS 344, 1988.
6. H. L. Bodlaender. On linear time minor tests and depth first search. In Proceedings Workshop on Algorithms and Data Structures WADS’89, pages 577-590. Springer Verlag, Lecture Notes in Computer Science, vol. 382, 1989.
7. R. B. Borie, R. G. Parker, and C. A. Tovey. Automatic generation of linear algorithms from predicate calculus descriptions of problems on recursive constructed graph families. Manuscript, 1988.
8. D. J. Brown, M. R. Fellows, and M. A. Langston. Nonconstructive polynomial-time decidability and self-reducibility. Int. J. Computer Math., 31: 1-9, 1989.
9. P. Erdös and G. Szekeres. A combinatorial problem in geometry. Compos. Math., 2: 464-470, 1935.
10. M. R. Fellows, 1989. Personal communication.
11. M. R. Fellows and M. A. Langston. On search, decision and the efficiency of polynomial-time algorithms. In Proceedings of the 21th Annual Symposium on Theory of Computing, pages 501-512, 1989.
12. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
13. J. Lagergren. Efficient parallel algorithms for tree-decomposition and related problems. In Proceedings of the 31th Annual Symposium on Foundations of Computer Science, pages 173-182, 1990.
14. N. Robertson and P. D. Seymour. Graph minors. XV. Wagner’s conjecture. To appear.
15. N. Robertson and P. D. Seymour. Graph minors - a survey. In I. Anderson, editor, Surveys in Combinatorics, pages 153-171. Cambridge Univ. Press, 1985.
16. N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. Manuscript, 1986.
17. J. van Leeuwen. Graph algorithms. In Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory, Amsterdam, 1990. North Holland Publ. Comp.
18. T. V. Wimer. Linear algorithms on k-terminal graphs. PhD thesis, Dept. of Computer Science, Clemson University, 1987.