Kernelization Using Structural Parameters on Sparse Graph Classes

DOI10.1007/978-3-642-40450-4_45zbMath1353.68126OpenAlexW2531503199MaRDI QIDQ2849343

Felix Reidl, Petr Hliněný, Jakub Gajarský, Sebastian Ordyniak, Fernando Sánchez Villaamil, Jan Obdržálek, Somnath Sikdar, Peter Rossmanith

Publication date: 17 September 2013

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

Full work available at URL: https://eprints.bbk.ac.uk/id/eprint/24755/6/24775.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (13)

Uniform Kernelization Complexity of Hitting Forbidden Minors ⋮ Solving Problems on Graphs of High Rank-Width ⋮ A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion ⋮ Fixed-parameter tractable distances to sparse graph classes ⋮ Linear kernels for outbranching problems in sparse digraphs ⋮ Finite Integer Index of Pathwidth and Treewidth ⋮ Meta-kernelization with structural parameters ⋮ Solving problems on graphs of high rank-width ⋮ Unnamed Item ⋮ A distributed low tree-depth decomposition algorithm for bounded expansion classes ⋮ Unnamed Item ⋮ On the Power of Simple Reductions for the Maximum Independent Set Problem ⋮ Structural sparsity of complex networks: bounded expansion in random models and real-world graphs

This page was built for publication: Kernelization Using Structural Parameters on Sparse Graph Classes