A characterization of graphs with vertex cover up to five

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

Volumn 831 LNCS, Issue , 1994, Pages 86-99

  Cattell, Kevin ^a   Dinneen, Michael J ^a,b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE STATE; FIXED SIZE; VERTEX COVER;

GRAPH THEORY;

EID: 84968399542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0019428     Document Type: Conference Paper

References (16)

1. Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski, and Detlef Seese. An algebraic theory of graph reduction. In Proceedings of the Fourth Workshop on Graph Grammars and Their Applications to Computer Science, volume 532, pp. 70-83. Lecture Notes in Computer Science, Springer-Verlag, 1991. To appear in Journal of the ACM.
2. Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12 (1991), pp. 308-340.
3. Hans L. Bodlaender. A linear time algorithm for finding tree-decompostions of small treewidth. In Proc. 25th Annual ACM Symposium on Theory of Computing. ACM Press, 1993.
4. Kevin Cattell and Michael J. Dinneen. VLSI Automated Compilation System — obstruction set computations (technical notes). In preparation.
5. Rod Downey and Michael R. Fellows. Parameterized computational feasibility. In P. Clote and J. Remmel, editors, Feasible Mathematics II. Birkhauser. To appear.
6. J. Ellis, I. H. Sudborough, and J. Turner. Graph separation and search number. Report DCS-66-IR, Dept. of Computer Science, University of Victoria, August 1987. To appear in Information and Computation.
7. Michael R. Fellows and Michael A. Langston. An analogue of the Myhill-Nerode Theorem and its use in computing finite-basis characterizations. In Proc. Symposium on Foundations of Computer Science (FOCS), pp. 520-525, 1989.
8. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
9. Ton Kloks. Treewidth. Ph.D. dissertation, Dept. of Computer Science, Utrecht University, Utrecht, the Netherlands, 1993.
10. András Kornai and Zsolt Tuza. Narrowness, pathwidth, and their application in natural language processing. Discrete Applied Mathematics, 36 (1992), pp. 87-92.
11. Jens Lagergren and Stefan Arnberg. Finding minimal forbidden minors using a finite congruence. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming, volume 510, pp. 533-543. Springer-Verlag, Lecture Notes in Computer Science, 1991.
12. Rolf H. Möhring. Graph problems releted to gate matrix layout and PLA folding. In G. Tinhofer, E. Mayr, H. Noltemeier, and M. Syslo, editors, Computational Graph Theory, pp. 17-51. Springer-Verlag, 1990.
13. Donald J. Rose. On simple characterizations of k-trees. Discrete Mathematics, 7 (1973), pp. 17-322.
14. Neil Robertson and Paul D. Seymour. Graph Minors. XVI. Wagner's conjecture. To appear Journal of Combinatorial Theory, Series B.
15. Neil Robertson and Paul D. Seymour. Graph Minors — A Survey, In Surveys in Combinatorics, volume 103, pp. 153-171, Cambridge University Press, 1985.
16. T. V. Wimer. Linear algorithms on k-terminal graphs. Ph.D. dissertation, Dept. of Computer Science, Clemson University, August 1987.