On the relation of strong triadic closure and cluster deletion
type: Item
instance of: scholarly article
title: On the relation of strong triadic closure and cluster deletion
zbMATH Open document ID: 1435.68234
zbMATH Open document ID: 1435.68235
DOI: 10.1007/978-3-030-00256-5_20
DOI: 10.1007/S00453-019-00617-1
author: Niels Grüttemeier
author: Christian Komusiewicz
published in: Graph-Theoretic Concepts in Computer Science
published in: Algorithmica
publication date: 2018-11-22T00:00:00Z
publication date: 2020-02-28T00:00:00Z
full work available at URL: https://arxiv.org/abs/1803.00807
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 91D30
zbMATH DE Number: 6983010
zbMATH DE Number: 7175607
MaRDI profile type: Publication
OpenAlex ID: W2789464506
OpenAlex ID: W2952751130
arXiv ID: 1803.00807
zbMATH Keywords: social networks
zbMATH Keywords: fixed-parameter algorithms
zbMATH Keywords: kernelization
zbMATH Keywords: graph classes
cites work: Even faster parameterized cluster deletion and cluster editing
cites work: Kernelization Lower Bounds by Cross-Composition
cites work: Kernel bounds for disjoint cycles and disjoint paths
cites work: Graph Classes: A Survey
cites work: Your rugby mates don't need to know your colleagues: triadic closure with edge colors
cites work: Parameterized Algorithms
cites work: Fundamentals of parameterized complexity
cites work: The cluster deletion problem for cographs
cites work: Q5116487
cites work: A more effective linear kernelization for cluster editing
cites work: The NP-Completeness of Edge-Coloring
cites work: Cluster editing with locally bounded modifications
cites work: Strong triadic closure in cographs and graphs of low maximum degree
cites work: Q5136273
cites work: Gallai graphs and anti-Gallai graphs
cites work: Paw-free graphs
cites work: Q4770411
cites work: Q4288086
cites work: Applying modular decomposition to parameterized cluster editing problems
cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
cites work: Cluster graph modification problems
cites work: Two classes of perfect graphs
cites work: Fixed-parameter algorithms for maximum-profit facility location under matroid constraints
Wikidata QID: Q127365021
description: scientific article; zbMATH DE number 7175607