Parameterized aspects of strong subgraph closure
From MaRDI portal
Publication:2182097
DOI10.1007/s00453-020-00684-9zbMath1442.68168arXiv1802.10386OpenAlexW2963372705MaRDI QIDQ2182097
Paloma T. Lima, Pinar Heggernes, Athanasios L. Konstantinidis, Charis Papadopoulos, Petr A. Golovach
Publication date: 21 May 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.10386
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (3)
A survey of parameterized algorithms and the complexity of edge modification ⋮ Cluster deletion on interval graphs and split related graphs ⋮ Your rugby mates don't need to know your colleagues: triadic closure with edge colors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Solving MAX-\(r\)-SAT above a tight lower bound
- A kernelization algorithm for \(d\)-hitting set
- On problems without polynomial kernels
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Two edge modification problems without polynomial kernels
- Parameterized complexity of finding subgraphs with hereditary properties.
- Algorithmic graph theory and perfect graphs
- Incompressibility of \(H\)-free edge modification problems
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Planar 3DM is NP-complete
- Edge-Deletion Problems
- Kernelization Lower Bounds Through Colors and IDs
- Kernelization Lower Bounds by Cross-Composition
- Parameterized Algorithms
- On the relation of strong triadic closure and cluster deletion
- Strong triadic closure in cographs and graphs of low maximum degree
This page was built for publication: Parameterized aspects of strong subgraph closure
