scientific article; zbMATH DE number 7205202
From MaRDI portal
Publication:5111877
DOI10.4230/LIPIcs.IPEC.2017.18zbMath1443.68129arXiv1710.10979MaRDI QIDQ5111877
Pinar Heggernes, Pedro Montealegre, Petr A. Golovach, Paloma T. Lima
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1710.10979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (4)
Finding \(k\)-secluded trees faster ⋮ Parameterized algorithms and data reduction for the short secluded s‐t‐path problem ⋮ Finding \(k\)-secluded trees faster ⋮ On the computational complexity of length- and neighborhood-constrained path problems
Cites Work
- Unnamed Item
- Fundamentals of parameterized complexity
- Parameterized graph separation problems
- Isolation concepts for efficiently enumerating dense subgraphs
- Isolation concepts for clique enumeration: comparison and computational experiments
- The node-deletion problem for hereditary properties is NP-complete
- Secluded connectivity problems
- On limited nondeterminism and the complexity of the V-C dimension
- Parameterized complexity of secluded connectivity problems
- Enumeration of isolated cliques and pseudo-cliques
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions
- The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
- Secluded Path via Shortest Path
- Parameterized Algorithms
This page was built for publication:
