How to use planarity efficiently: New tree-decomposition based algorithms

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

Volumn 4769 LNCS, Issue , 2007, Pages 280-291

  Dorn, Frederic ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; DYNAMIC PROGRAMMING; PROBLEM SOLVING;

GRAPH SEPARATORS; JORDAN CURVES; TREE DECOMPOSITION;

TREES (MATHEMATICS);

EID: 38549179785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74839-7_27     Document Type: Conference Paper

References (31)

1. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33, 461-493 (2002)
2. Alber, J., Bodlaender, H.L., Fernau, H., Niedermeier, R.: Fixed parameter algorithms for planar dominating set and related problems. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 97-110. Springer, Heidelberg (2000)
3. Alber, J., Niedermeier, R.: Improved tree decomposition based algorithms for domination-like problems. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 613-627. Springer, Heidelberg (2002)
4. Arora, S., Grigni, M., Karger, D., Klein, P., Woloszyn, A.: A polynomial-time approximation scheme for weighted planar graph TSP. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, pp. 33-41. ACM Press, New York (1998)
5. Bernstein, P.A., Goodman, N.: Power of natural semijoins. SIAM Journal on Computing 10, 751-771 (1981)
6. Bodlaender, H.: Treewidth: Algorithmic techniques and results. In: Privara, I., Ružička, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 19-36. Springer, Heidelberg (1997)
7. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernet. 11, 1-21 (1993)
8. Bodlaender, H.L., Möhring, R.H.: The pathwidth and treewidth of cographs. SIAM Journal on Discrete Mathematics 6, 181-188 (1993)
9. Bouchitté, V., Mazoit, F., Todinca, I.: Chordal embeddings of planar graphs. Discrete Mathematics 273, 85-102 (2003)
10. Cook, W., Seymour, P.: Tour merging via branch-decomposition. INFORMS Journal on Computing 15, 233-248 (2003)
11. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. Journal of the ACM 52, 866-893 (2005)
12. Diestel, R.: Graph theory, 3rd edn. Springer, Heidelberg (2005)
13. Dorn, F.: Dynamic programming and fast matrix multiplication. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 280-291. Springer, Heidelberg (2006)
14. Dorn, F.: How to use planarity efficiently: new tree-decomposition based algorithms (manuscript, 2007), http://www.ii.uib.no/frederic/PlanDomSet.pdf
15. Dorn, F., Fomin, F.V., Thilikos, D.M.: Fast subexponential algorithm for non-local problems on graphs of bounded genus. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 172-183. Springer, Heidelberg (2006)
16. Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. In: Brodai, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 95-106. Springer, Heidelberg (2005)
17. Dorn, F., Telle, J.A.: Two birds with one stone: the best of branchwidth and treewidth with one algorithm. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 386-397. Springer, Heidelberg (2006)
18. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3, 1-27 (1999)
19. Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: branch-width and exponential speed-up. In: SODA 2003. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, pp. 168-177. ACM Press, New York (2003)
20. Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal of Combinatorial Theory Series B 16, 47-56 (1974)
21. Heggernes, P.: Minimal triangulations of graphs: A survey. Discrete Mathematics 306, 297-317 (2006)
22. Ho, C.W., Lee, R.C.T.: Counting clique trees and computing perfect elimination schemes in parallel. Inf. Process. Lett. 31, 61-68 (1989)
23. Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177-189 (1979)
24. Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. Journal of Computer and System Science 32, 265-279 (1986)
25. Parra, A., Schemer, P.: Characterizations and algorithmic applications of chordal graph embeddings. Discrete Applied Mathematics 79, 171-188 (1997)
26. Parter, S.: The use of linear graphs in Gauss elimination. SIAM Review 3, 119-130 (1961)
27. Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52, 153-190 (1991)
28. Rose, D., Tarjan, R.E., Lueker, G.: Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing 5, 146-160 (1976)
29. Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing 13, 566-579 (1984)
30. Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math 10, 529-550 (1997)
31. van Leeuwen, J.: Graph algorithms. MIT Press, Cambridge, MA, USA (1990)