Parameterized aspects of strong subgraph closure
type: Item
instance of: scholarly article
title: Parameterized aspects of strong subgraph closure
zbMATH Open document ID: 1442.68168
author: Pinar Heggernes
author: Athanasios L. Konstantinidis
author: Paloma T. Lima
author: Charis Papadopoulos
author: Petr A. Golovach
published in: Algorithmica
publication date: 2020-05-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/1802.10386
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8849/
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q27
zbMATH DE Number: 7202654
zbMATH Keywords: strong triadic closure
zbMATH Keywords: parameterized complexity
zbMATH Keywords: forbidden subgraphs
MaRDI profile type: Publication
OpenAlex ID: W2963372705
arXiv ID: 1802.10386
cites work: A kernelization algorithm for \(d\)-hitting set
cites work: Solving MAX-\(r\)-SAT above a tight lower bound
cites work: On problems without polynomial kernels
cites work: Kernelization Lower Bounds by Cross-Composition
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: Incompressibility of \(H\)-free edge modification problems
cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
cites work: Designing FPT Algorithms for Cut Problems Using Randomized Contractions
cites work: Parameterized Algorithms
cites work: Kernelization Lower Bounds Through Colors and IDs
cites work: Fundamentals of parameterized complexity
cites work: Planar 3DM is NP-complete
cites work: Q4931752
cites work: Q5116487
cites work: Algorithmic graph theory and perfect graphs
cites work: On the relation of strong triadic closure and cluster deletion
cites work: Parameterized complexity of finding subgraphs with hereditary properties.
cites work: Strong triadic closure in cographs and graphs of low maximum degree
cites work: Q5136273
cites work: Two edge modification problems without polynomial kernels
cites work: Edge-Deletion Problems
DOI: 10.1007/S00453-020-00684-9
description: scientific article