Partitioning subclasses of chordal graphs with few deletions
From MaRDI portal
Publication:6144015
DOI10.1016/J.TCS.2023.114288MaRDI QIDQ6144015
Satyabrata Jana, Abhishek Sahu, Shaily Verma, Saket Saurabh, Souvik Saha
Publication date: 5 January 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
- Parameterized graph separation problems
- The complexity of generalized clique packing
- Algorithmic graph theory and perfect graphs
- LP Relaxation and Tree Packing for Minimum $k$-Cut
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- Finding k Cuts within Twice the Optimal
- A new approach to the minimum cut problem
- Randomized Contractions Meet Lean Decompositions
- Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis
- A nearly 5/3-approximation FPT Algorithm for Min-k-Cut
- A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
- The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
- Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
This page was built for publication: Partitioning subclasses of chordal graphs with few deletions
