scientific article; zbMATH DE number 7204520
From MaRDI portal
Publication:5111399
DOI10.4230/LIPIcs.ICALP.2017.68zbMath1441.68188arXiv1608.01463MaRDI QIDQ5111399
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1608.01463
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (18)
Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies ⋮ A parameterized complexity view on collapsing \(k\)-cores ⋮ Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds ⋮ A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion ⋮ Preprocessing to reduce the search space: antler structures for feedback vertex set ⋮ Kernelization for feedback vertex set via elimination distance to a forest ⋮ Kernelization for feedback vertex set via elimination distance to a forest ⋮ Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs ⋮ Exact algorithms for restricted subset feedback vertex set in chordal and split graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Multi-Budgeted Directed Cuts ⋮ An improved FPT algorithm for independent feedback vertex set ⋮ Improved analysis of highest-degree branching for feedback vertex set ⋮ Unnamed Item ⋮ Multi-budgeted directed cuts ⋮ Euler Digraphs
This page was built for publication:
