Parameterized aspects of strong subgraph closure
From MaRDI portal
Publication:5116487
DOI10.4230/LIPICS.SWAT.2018.23zbMATH Open1442.68169MaRDI QIDQ5116487FDOQ5116487
Petr A. Golovach, Pinar Heggernes, Charis Papadopoulos, Paloma T. Lima, Athanasios L. Konstantinidis
Publication date: 25 August 2020
Recommendations
- Parameterized aspects of strong subgraph closure
- On the relation of strong triadic closure and cluster deletion
- On the relation of strong triadic closure and cluster deletion
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- Maximizing the strong triadic closure in split graphs and proper interval graphs
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Title not available (Why is that?)
- Fixed-parameter tractability of graph modification problems for hereditary properties
- On problems without polynomial kernels
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Parameterized Algorithms
- Solving MAX-\(r\)-SAT above a tight lower bound
- Kernelization Lower Bounds Through Colors and IDs
- Sparsity. Graphs, structures, and algorithms
- Parameterized complexity of finding subgraphs with hereditary properties.
- Edge-Deletion Problems
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions
- Neighborhood complexity and kernelization for nowhere dense classes of graphs
- Incompressibility of \(H\)-free edge modification problems
- Two edge modification problems without polynomial kernels
- Strong triadic closure in cographs and graphs of low maximum degree
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Parameterized aspects of strong subgraph closure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116487)
