Feedback Vertex Set on Graphs of Low Cliquewidth
暂无分享,去创建一个
[1] Amit Kumar,et al. Wavelength conversion in optical networks , 1999, SODA '99.
[2] Michaël Rao. Décompositions de graphes et algorithmes efficaces , 2006 .
[3] Ton Kloks,et al. New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs , 2002, WG.
[4] Laurent Viennot,et al. Partition Refinement Techniques: An Interesting Algorithmic Tool Kit , 1999, Int. J. Found. Comput. Sci..
[5] Petr Hliněný,et al. Finding branch-decomposition and rank-decomposition , 2008 .
[6] Michal Pilipczuk,et al. Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[7] Michael R. Fellows,et al. An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem , 2005, COCOON.
[8] Udi Rotics,et al. Edge dominating set and colorings on graphs with fixed clique-width , 2003, Discret. Appl. Math..
[9] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[10] David P. Williamson,et al. Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs , 1996, Comb..
[11] Paul D. Seymour,et al. Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.
[12] Jan Arne Telle,et al. Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions , 2009, ArXiv.
[13] Paul D. Seymour,et al. Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.
[14] Jianer Chen,et al. Improved algorithms for feedback vertex set problems , 2007, J. Comput. Syst. Sci..
[15] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[16] Rolf Niedermeier,et al. Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization , 2006, J. Comput. Syst. Sci..
[17] Joseph Naor,et al. Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications , 2000, SIAM J. Discret. Math..
[18] Saket Saurabh,et al. Faster fixed parameter tractable algorithms for finding feedback vertex sets , 2006, TALG.
[19] Egon Wanke,et al. How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time , 2001, WG.
[20] Reuven Bar-Yehuda,et al. Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference , 1998, SIAM J. Comput..
[21] Robert Ganian,et al. On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width , 2010, Discret. Appl. Math..
[22] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[23] Jean-Marc Lanlignel. Autour de la décomposition en coupes , 2001 .
[24] Dimitrios M. Thilikos,et al. Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms , 2008, WG.
[25] David P. Williamson,et al. A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs , 1998, Oper. Res. Lett..
[26] Piotr Berman,et al. A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..
[27] Jan Arne Telle,et al. H-join decomposable graphs and algorithms with runtime single exponential in rankwidth , 2010, Discret. Appl. Math..
[28] Michaël Rao,et al. Clique-width of graphs defined by one-vertex extensions , 2008, Discret. Math..
[29] Robert E. Tarjan,et al. Three Partition Refinement Algorithms , 1987, SIAM J. Comput..
[30] Fedor V. Fomin,et al. On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms , 2008, Algorithmica.