Representative sets and irrelevant vertices: new tools for kernelization

DOI10.1109/FOCS.2012.46MaRDI QIDQ6988200zbMATH OpenFDO

Authors Stefan Kratsch, Magnus Wahlström

Publication date 5 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2012.46

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(5)

• On quasipolynomial multicut-mimicking networks and kernelization of multiway cut problems
• Bridge-depth characterizes which structural parameterizations of vertex cover admit a polynomial kernel
• Quasipolynomial-time deterministic kernelization and (gammoid) representation
• All-subsets important separators with applications to sample sets, balanced separators and vertex sparsifiers in directed graphs
• Cut-preserving vertex sparsifiers for planar and quasi-bipartite graphs

This page was built for publication: Representative sets and irrelevant vertices: new tools for kernelization

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