Strong triadic closure in cographs and graphs of low maximum degree
type: Item
instance of: scholarly article
title: Strong triadic closure in cographs and graphs of low maximum degree
zbMATH Open document ID: 1395.68212
author: Athanasios L. Konstantinidis
author: Stavros D. Nikolopoulos
author: Charis Papadopoulos
published in: Theoretical Computer Science
publication date: 2018-06-08T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6882317
zbMATH Keywords: strong triadic closure
zbMATH Keywords: cluster deletion
zbMATH Keywords: cographs
zbMATH Keywords: bounded degree graphs
zbMATH Keywords: NP-completeness
zbMATH Keywords: polynomial-time algorithm
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.05.012
OpenAlex ID: W2803851338
cites work: Correlation clustering
cites work: Complexity of the cluster deletion problem on subclasses of chordal graphs
cites work: Parameterized algorithms for finding square roots
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Parameterized Algorithms
cites work: Q4931752
cites work: Exact exponential algorithms.
cites work: The cluster deletion problem for cographs
cites work: On Independence Domination
cites work: Which problems have strongly exponential complexity?
cites work: Q5302113
cites work: Independence numbers of product graphs
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: Q4904144
cites work: A fully dynamic algorithm for modular decomposition and recognition of cographs.
cites work: Cluster graph modification problems
cites work: Q4414647
DOI: 10.1016/J.TCS.2018.05.012
description: scientific article; zbMATH DE number 6882317