scientific article; zbMATH DE number 7768372

DOI10.4230/LIPICS.APPROX/RANDOM.2021.27MaRDI QIDQ6090902zbMATH OpenFDO

Authors Ralf Borndörfer, Katrin Casel, Davis Issac, Stephan Schwartz

Publication date 20 November 2023

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

zbMATH Keywords

approximation algorithmsbalanced partitionconnected partitionGyőri-Lovász

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(8)

• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• On a k-clique-join of a class of partitionalble graphs
• Counting connected partitions of graphs
• Combining crown structures for vulnerability measures
• Combining crown structures for vulnerability measures
• Connected partitions via connected dominating sets
• Approximation algorithms for connected k-edge partition
• The path partition conjecture is true for claw-free graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090902)