Circular Convex Bipartite Graphs: Feedback Vertex Set
From MaRDI portal
Publication:2867126
DOI10.1007/978-3-319-03780-6_24zbMath1339.05399MaRDI QIDQ2867126
Tian Liu, Min Lu, Zhao Lu, Ke Xu
Publication date: 10 December 2013
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_24
tractability; feedback vertex set; circular convex bipartite graph; convex bipartite graph; Cook reduction
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)