Computing crossing numbers in quadratic time

Journal of Computer and System Sciences

Volumn 68, Issue 2, 2004, Pages 285-302

  Grohe, Martin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GRAPH THEORY; SET THEORY; THEOREM PROVING;

CROSSING NUMBER; QUADRATIC TIME ALGORITHM;

ALGORITHMS;

EID: 1842615020     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2003.07.008     Document Type: Article

References (19)

1. H.L. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996) 1305-1317.
2. J. Chen, I.A. Kanj, W. Jia, Vertex cover: further observations and further improvements, in: Proceedings of the 25th International Workshop on Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 1665, Springer, Berlin, 1999, pp. 313-324.
3. S.S. Cosmadakis, Logical reducibility and monadic NP. in: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, 1993, pp. 52-61.
4. B. Courcelle, Graph rewriting: an algebraic and logic approach, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. 2, Elsevier, Amsterdam, 1990, pp. 194-242.
5. B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformations, Vol. 1: Foundations World Scientific, New-Jersey, London, 1997, pp. 313-400 (Chapter 5).
6. B. Courcelle, The monadic second-order logic of graphs XII: planar graphs and planar maps, Theoret. Comput. Sci. 237 (2000) 1-32.
7. R.G. Downey, M.R. Fellows, Parameterized Complexity, Springer, Berlin, 1999.
8. H.-D. Ebbinghasu, J. Flum, W. Thomas, Mathematical Logic, 2nd Edition, Springer, Berlin, 1994.
9. M.R. Fellows, M.A. Langston, Nonconstructive tools for proving polynomial-time decidability, J. ACM 35 (1988) 727-739.
10. O(g)) steps, in: Proceedings of the 11th ACM Symposium on Theory of Computing, Atlanta, GA, 1979, pp. 27-37.
11. J. Flum, M. Frick, M. Grohe, Query evaluation via tree-decompositions, Journal of the ACM 49 (2002) 716-752.
12. M.R. Garey, D.S. Johnson, The NP-completeness column: an ongoing guide, J. Algorithms 3 (1982) 89-99.
13. J.E. Hopcroft, R. Tarjan, Efficient planarity testing, J. ACM 21 (1974) 549-568.
14. B. Mohar, Embedding graphs in an arbitrary surface in linear time, in: Proceedings of the 28th ACM Symposium on Theory of Computing, Philadelphia, PA, 1996, pp. 392-397.
15. L. Perković, B. Reed, An improved algorithm for finding tree decompositions of small width, Internat. J. Foundations of Comput. Sci. 11 (3) (2000) 365-371.
16. N. Robertson, P.D. Seymour, Graph minors V. Excluding a planar graph, J. Combin. Theory Ser. B 41 (1986) 92-114.
17. N. Robertson, P.D. Seymour, Graph minors XIII. The disjoint paths problem, J. Combin. Theory, Ser. B 63 (1995) 65-110.
18. C. Thomassen, The graph genus problem is NP-complete, J. Algorithms 10 (1988) 458-576.
19. C. Thomassen, A simpler proof of the excluded minor theorem for higher surfaces, J. Combin. Theory Ser. B 70 (1997) 306-311.