Finding Branch-Decompositions and Rank-Decompositions
暂无分享,去创建一个
[1] Paul D. Seymour,et al. Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.
[2] Bert Gerards,et al. On the excluded minors for the matroids of branch-width k , 2003, J. Comb. Theory, Ser. B.
[3] Petr Hlinený,et al. Branch-width, parse trees, and monadic second-order logic for matroids , 2003, J. Comb. Theory, Ser. B.
[4] Illya V. Hicks,et al. The branchwidth of graphs and their cycle matroids , 2007, J. Comb. Theory, Ser. B.
[5] Lorna Stewart,et al. A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..
[6] James G. Oxley,et al. Matroid theory , 1992 .
[7] Bruno Courcelle,et al. Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..
[8] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[9] Robin Thomas,et al. Call routing and the ratcatcher , 1994, Comb..
[10] Michael U. Gerber,et al. Algorithms for vertex-partitioning problems on graphs with fixed clique-width , 2003, Theor. Comput. Sci..
[11] Egon Wanke,et al. How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time , 2001, WG.
[12] Bert Gerards,et al. Tangles, tree-decompositions and grids in matroids , 2009, J. Comb. Theory, Ser. B.
[13] B. Mohar,et al. Graph Minors , 2009 .
[14] Paul D. Seymour,et al. Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.
[15] Petr Hlinený,et al. A Parametrized Algorithm for Matroid Branch-Width , 2005, SIAM J. Comput..
[16] J. Hirschfeld,et al. The packing problem in statistics, coding theory and finite projective spaces : update 2001 , 2001 .
[17] Bruno Courcelle,et al. Vertex-minors, monadic second-order logic, and a conjecture by Seese , 2007, J. Comb. Theory, Ser. B.
[18] Stéphan Thomassé,et al. Branchwidth of graphic matroids , 2007 .
[19] Egon Wanke,et al. k-NLC Graphs and Polynomial Algorithms , 1994, Discret. Appl. Math..
[20] B. Reed,et al. Polynomial Time Recognition of Clique-Width ≤ 3 Graphs , 2000 .
[21] Sang-il Oum,et al. Rank-width and vertex-minors , 2005, J. Comb. Theory, Ser. B.
[22] Udi Rotics,et al. Edge dominating set and colorings on graphs with fixed clique-width , 2003, Discret. Appl. Math..
[23] Pierre Fraigniaud,et al. The price of connectedness in expansions , 2004 .
[24] Sang-il Oum,et al. Approximating rank-width and clique-width quickly , 2008, ACM Trans. Algorithms.
[25] Paul D. Seymour,et al. Testing branch-width , 2007, J. Comb. Theory, Ser. B.
[26] Udi Rotics,et al. Clique-width minimization is NP-hard , 2006, STOC '06.