Circular convex bipartite graphs: feedback vertex sets

DOI10.1016/j.tcs.2014.05.001zbMath1339.05398MaRDI QIDQ300230

Tian Liu, Min Lu, Zhao Lu, Ke Xu

Publication date: 27 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.05.001

zbMATH Keywords

tractability; feedback vertex set; circular convex bipartite graph; convex bipartite graph; Cook reduction

Mathematics Subject Classification ID

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.)