Circular convex bipartite graphs: feedback vertex sets
From MaRDI portal
Publication:300230
DOI10.1016/j.tcs.2014.05.001zbMath1339.05398OpenAlexW2041875351MaRDI QIDQ300230
Ke Xu, Zhao Lu, Tian Liu, Min Lu
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
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Solving problems on generalized convex graphs via mim-width ⋮ Domination in some subclasses of bipartite graphs ⋮ Induced Matching in Some Subclasses of Bipartite Graphs ⋮ Maximum Edge Bicliques in Tree Convex Bipartite Graphs ⋮ Solving problems on generalized convex graphs via mim-width ⋮ Maximum weight induced matching in some subclasses of bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feedback vertex sets on restricted bipartite graphs
- Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
- On parameterized independent feedback vertex set
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs
- Domination in convex and chordal bipartite graphs
- Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Feedback vertex sets in star graphs
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
- Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
- An Improved Exact Algorithm for Undirected Feedback Vertex Set
- Independent Domination on Tree Convex Bipartite Graphs
- Two Hardness Results on Feedback Vertex Sets
- Finding Induced Subgraphs via Minimal Triangulations
- Feedback Vertex Sets on Tree Convex Bipartite Graphs
- On Feedback Vertex Set New Measure and New Structures
- Node-Deletion Problems on Bipartite Graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Graph Classes: A Survey
- A REVIEW OF TREE CONVEX SETS TEST
- Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract)
- Reducibility among Combinatorial Problems
- Tractable Feedback Vertex Sets in Restricted Bipartite Graphs
- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
- Maximum matching in a convex bipartite graph
- Spin Glass approach to the feedback vertex set problem
This page was built for publication: Circular convex bipartite graphs: feedback vertex sets
