Pathwidth of cubic graphs and exact algorithms

Information Processing Letters

Volumn 97, Issue 5, 2006, Pages 191-196

  Fomin, Fedor V ^a   Høie, Kjartan ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Cubic graph; Exact exponential algorithm; Graph algorithms; Max cut; Maximum independent set; Minimum dominating set; Pathwidth; Treewidth

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING;

CUBIC GRAPH; GRAPH ALGORITHMS; MAX-CUT; MAXIMUM INDEPENDENT SET; MINIMUM DOMINATING SET; PATHWIDTH; TREEWIDTH;

GRAPH THEORY;

EID: 30344467209     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.10.012     Document Type: Article

References (25)

1. J. Alber, H.L. Bodlaender, H. Fernau, T. Kloks, and R. Niedermeier Fixed parameter algorithms for dominating set and related problems on planar graphs Algorithmica 33 2002 461 493
2. R. Beigel Finding maximum independent sets in sparse and general graphs Proc. 10th ACM-SIAM Symp. on Discrete Algorithms (SODA 1999) 1999 ACM and SIAM 856 857
3. S. Bezrukov, R. Elsässer, B. Monien, R. Preis, and J.-P. Tillich New spectral lower bounds on the bisection width of graphs Theoret. Comput. Sci. 320 2004 155 174
4. H.L. Bodlaender A partial k-arboretum of graphs with bounded treewidth Theoret. Comput. Sci. 209 1998 1 45
5. J. Chen, I.A. Kanj, and G. Xia Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems Proc. 14th Annual Internat. Symp. on Algorithms and Computation (ISAAC 2003) Lecture Notes in Comput. Sci. vol. 2906 2003 Springer Berlin 148 157
6. J.A. Ellis, I.H. Sudborough, and J.S. Turner The vertex separation and search number of a graph Inform. and Comput. 113 1994 50 79
7. F.V. Fomin, F. Grandoni, and D. Kratsch Measure and conquer: Domination - a case study Proc. 32nd Internat. Colloquium on Automata, Languages and Programming (1CALP 2005) Lecture Notes in Comput. Sci. vol. 3580 2005 Springer Berlin 191 203
8. F.V. Fomin, D. Kratsch, and G.J. Woeginger Exact (exponential) algorithms for the dominating set problem Proc. 30th Workshop on Graph Theoretic Concepts in Computer Science (WG 2004) Lecture Notes in Comput. Sci. vol. 3353 2004 Springer Berlin 245 256
9. F.V. Fomin, and D.M. Thilikos A simple and fast approach for solving problems on planar graphs Proc. 21st Internat. Symp. on Theoretical Aspects of Computer Science (STAGS 2004) Lecture Notes in Comput. Sci. vol. 2996 2004 Springer Berlin 56 67
10. J. Gramm, E.A. Hirsch, R. Niedermeier, and P. Rossmanith Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT Discrete Appl. Math. 130 2003 139 155
11. F. Grandoni, Exact algorithms for hard graph problems, PhD thesis, Università di Roma "Tor Vergata", Roma, Italy, March, 2004
12. F. Grandoni, A note on the complexity of minimum dominating set, J. Discrete Algorithms, in press
13. R. Impagliazzo, R. Paturi, and F. Zane Which problems have strongly exponential complexity J. Comput. System Sci. 63 2001 512 530
14. K. Jansen, M. Karpinski, A. Lingas, and E. Seidel Polynomial time approximation schemes for Max-Bisection on planar and geometric graphs Proc. 18th Annual Symp. on Theoretical Aspects of Computer Science (STAGS 2001) Lecture Notes in Comput. Sci. vol. 2010 2001 Springer Berlin 365 375
15. D.S. Johnson, and M. Szegedy What are the least tractable instances of max independent set? Proc. 10th ACM-SIAM Symp. on Discrete Algorithms (SODA'1999) 1999 ACM and SIAM 927 928
16. J. Kneis, D. Mölle, S. Richter, P. Rossmanith, Algorithms based in treewidth of sparse graphs, in: Proc. 31st Internat. Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), in: Lecture Notes in Comput. Sci., vol. 3787, Springer, Berlin, 2005, in press
17. A. Kojevnikov, and A.S. Kulikov A new approach for proving upper bounds for MAX-2-SAT Proc. 17th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2006) 2006 New York ACM and SIAM
18. A.S. Kulikov, and S.S. Fedin Solution of the maximum cut problem in time 2 | E | / 4 Zapiski Nauchnykh Seminarov (POMI) 293 2002 129 138 183
19. B. Monien, and R. Preis Upper bounds on the bisection width of 3- and 4-regular graphs Proc. 26th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS 2001) Lecture Notes in Comput. Sci. vol. 2136 2001 Springer Berlin 524 536
20. B. Randerath, I. Schiermeyer, Exact algorithms for MINIMUM DOMINATING SET, Technical Report zaik-469, Zentrum für Angewandte Informatik Köln, Germany, 2004
21. B. Reed Paths, stars and the number three Combin. Probab. Comput. 5 1996 277 295
22. N. Robertson, and P.D. Seymour Graph minors. II. Algorithmic aspects of tree-width J. Algorithms 7 1986 309 322
23. J.M. Robson Finding a maximum independent set in time O (2 n / 4 ) Manuscript http://dept-info.labri.fr/robson/mis/techrep.html 2001
24. R.E. Tarjan, and A.E. Trojanowski Finding a maximum independent set SIAM J. Comput. 6 1977 537 546
25. R. Williams A new algorithm for optimal constraint satisfaction and its implications Proc. 31st Internat. Colloquium on Automata, Languages and Programming (ICALP 2004) Lecture Notes in Comput. Sci. vol. 3142 2004 Springer Berlin 1227 1237