Partitioning subclasses of chordal graphs with few deletions

DOI10.1007/978-3-031-30448-4_21MaRDI QIDQ6057343

Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma

Publication date: 4 October 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

chordal graphsinterval graphspermutation graphscircular-arc graphsFPT

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• 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 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
• The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable

This page was built for publication: Partitioning subclasses of chordal graphs with few deletions