Randomized Contractions Meet Lean Decompositions

DOI10.1145/3426738OpenAlexW3113894442MaRDI QIDQ5028343

Marcin Pilipczuk, Daniel Lokshtanov, Saket Saurabh, Marek Cygan, Michał Pilipczuk, Paweł Komosa, Magnus Wahlström

Publication date: 8 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.06864

zbMATH Keywords

minimum bisectionlean decompositionsrandomized contractions

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (4)

Partitioning subclasses of chordal graphs with few deletions ⋮ Partitioning subclasses of chordal graphs with few deletions ⋮ On Weighted Graph Separation Problems and Flow Augmentation ⋮ An FPT algorithm for matching cut and d-cut

This page was built for publication: Randomized Contractions Meet Lean Decompositions