Planar subgraph isomorphism revisited

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 5, Issue , 2010, Pages 263-274

  Dorn, Frederic ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Dynamic programming; Graph algorithms; NP hard problems; Subgraph Isomorphism; Topological graph theory

Indexed keywords

ALL SOLUTIONS; GRAPH ALGORITHMS; LINEAR-TIME ALGORITHMS; STRUCTURED GRAPHS; SUBGRAPH ISOMORPHISM; SUPER-EXPONENTIAL; TIME ALGORITHMS; TOPOLOGICAL GRAPH THEORIES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DYNAMIC PROGRAMMING; SET THEORY;

GRAPH THEORY;

EID: 84880259340     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2010.2460     Document Type: Conference Paper

References (27)

1. N. Alon, R. Yuster, and U. Zwick, Color-coding, J. Assoc. Comput. Mach., 42 (1995), pp. 844-856.
2. B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. Assoc. Comput. Mach., 41 (1994), pp. 153-180.
3. H. L. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput., 25 (1996), pp. 1305-1317.
4. K. Buchin, C. Knauer, K. Kriegel, A. Schulz, and R. Seidel, On the number of cycles in planar graphs, in Proc. of the 13th Annual International Conference on Computing and Combinatorics (COCOON'07), vol. 4598 of LNCS, Springer, 2007, pp. 97-107.
5. A. Dawar, M. Grohe, and S. Kreutzer, Locally excluding a minor, in Proc. of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), IEEE Computer Society, 2007, pp. 270-279.
6. E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos, Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, J. ACM, 52 (2005), pp. 866-893.
7. E. D. Demaine and M. T. Hajiaghayi, The bidimensionality theory and its algorithmic applications, Computer J., 51 (2008), pp. 292-302.
8. E. D. Demaine, M. T. Hajiaghayi, and K. Kawarabayashi, Algorithmic graph minor theory: Decomposition, approximation, and coloring, in Proc. of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), IEEE Computer Society, 2005, pp. 637-646.
9. R. Diestel, Graph theory, vol. 173 of Grad. Texts in Math., Springer, New York, third ed., 2000.
10. F. Dorn, Planar Subgraph Isomorphism Revisited, http://arxiv.org/abs/ 0909.4692, 2009.
11. F. Dorn, F. V. Fomin, and D. M. Thilikos, Catalan structures and dynamic programming on H-minor-free graphs, in Proc. of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), ACM, New York, 2008, pp. 631-640.
12. F. Dorn, E. Penninkx, H. L. Bodlaender, and F. V. Fomin, Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions, Algorithmica, (2009, to appear).
13. R. G. Downey and M. R. Fellows, Parameterized complexity, Springer, New York, 1999.
14. D. Eppstein, Subgraph isomorphism in planar graphs and related problems, J. Graph Alg. and Appl., 3 (1999), pp. 1-27.
15. D. Eppstein, Diameter and treewidth in minor-closed graph families, Algorithmica, (2009).
16. J. Flum and M. Grohe, Parameterized Complexity Theory, Texts in Theoretical Computer Science. EATCS Series, Springer, Berlin, 2006.
17. F. V. Fomin and D. M. Thilikos, New upper bounds on the decomposability of planar graphs, J. Graph Theory, 51 (2006), pp. 53-81.
18. 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.
19. J. E. Hopcroft and J. K. Wong, Linear time algorithm for isomorphism of planar graphs (preliminary report), in Proc. of the Sixth Annual ACM Symposium on Theory of Computing (STOC'74), ACM, 1974, pp. 172-184.
20. Z. Li and S.-I. Nakano, Efficient generation of plane triangulations without repetitions, in Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01), vol. 2076 of LNCS, Springer, 2001, pp. 433-443.
21. R. Niedermeier, Invitation to fixed-parameter algorithms, vol. 31 of Oxford Lecture Series in Mathematics and its Applications, Oxford University Press, Oxford, 2006.
22. D. Osthus, H. J. Prömel, and A. Taraz, On random planar graphs, the number of planar graphs and their triangulations, J. Combin. Theory Ser. B, 88(1) (2003), pp. 119-134.
23. J. Plehn and B. Voigt, Finding minimally weighted subgraphs, in Proc. of the 16th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'90), vol. 484 of LNCS, Springer, 1990, pp. 18-29.
24. N. Robertson, P. Seymour, and R. Thomas, Quickly excluding a planar graph, J. Combin. Theory Ser. B, 62 (1994), pp. 323-348.
25. N. Robertson and P. D. Seymour, Graph minors. XVI. Excluding a non-planar graph, J. Combin. Theory Ser. B, 89 (2003), pp. 43-76.
26. H. Tamaki, A linear time heuristic for the branch-decomposition of planar graphs, in Proc. of the 11th Annual European Symposium on Algorithms (ESA'03), vol. 2832 of LNCS, Springer, 2003, pp. 765-775.
27. W. T. Tutte, A census of planar triangulations, Canad. J. Math., 14 (1962), pp. 21-38.