Width parameters beyond tree-width and their applications (2007)

Cached

Download Links

by Petr Hliněny , Sang-il Oum , Detlef Seese , Georg Gottlob
Venue:Computer Journal
Citations:19 - 0 self

Documents Related by Co-Citation

56 Approximating clique-width and branch-width – Sang-il Oum, Paul Seymour - 2006
190 A linear-time algorithm for finding tree-decompositions of small treewidth – H L Bodlaender - 1996
894 Parameterized Complexity – Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen - 1998
367 Parameterized Complexity Theory – J Flum, M Grohe - 2006
44 Upper bounds to the clique width of graphs – B Courcelle, S Olariu
168 Graph minors. X. Obstructions to tree-decomposition – Neil Robertson, P. D. Seymour - 1991
29 Finding branch-decompositions and rank-decompositions – Sang-il Oum - 2007
113 Linear time solvable optimization problems on graphs of bounded clique-width, Extended abstract – B. Courcelle, J. A. Makowsky, U. Rotics - 1998
42 On the relationship between clique-width and tree-width – D G Corneil, U Rotics - 2005
293 Invitation to Fixed-Parameter Algorithms – Rolf Niedermeier - 2002
33 Polynomial time recognition of clique-width �3 graphs, Extended abstract. in – D G Corneil, M Habib, J-M Lanlignel, B Reed, U Rotics
33 k-NLC Graphs and Polynomial Algorithms – Frank Gurski, Egon Wanke
14 Algorithms for vertex partitioning problems on graphs with fixed clique-width, Theoretical Computer Science 299 – M U Gerber, D Kobler - 2003
230 Easy Problems for Tree-Decomposable Graphs – Stefan Arnborg, Jens Lagergren - 1991
21 Combinatorial Optimization on Graphs of Bounded Treewidth – Hans L. Bodlaender, Arie M. C. A. Koster - 2007
87 Invitation to data reduction and problem kernelization – J Guo, R Niedermeier
297 Graph classes: a survey – A Brandstädt, V B Le, J P Spinrad - 1999
7 partitioning problems on graphs of bounded treewidth and clique-width, Theor – MSOL M Rao - 2013
46 The monadic second-order logic of graphs III: treedecompositions, minors and complexity issues. Informatique Théoretique et Applications 26:257–286 – B Courcelle - 1992