Cograph generation with linear delay
type: Item
instance of: scholarly article
title: Cograph generation with linear delay
zbMATH Open document ID: 1387.05253
author: Átila A. Jones
author: Fábio Protti
author: Renata Del-Vecchio
published in: Theoretical Computer Science
publication date: 2018-02-06T00:00:00Z
full work available at URL: https://arxiv.org/abs/1612.05827
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 6834897
zbMATH Keywords: cographs
zbMATH Keywords: enumerative combinatorics
zbMATH Keywords: enumerative algorithms
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2585040531
arXiv ID: 1612.05827
cites work: Complement reducible graphs
cites work: Q3676177
cites work: Linear delay enumeration and monadic second-order logic
cites work: Database Programming Languages
cites work: Classes of perfect graphs
cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
cites work: A search strategy for the elementary cycles of a directed graph
cites work: Asymptotic enumeration of cographs
DOI: 10.1016/J.TCS.2017.12.037
Recommended article: Linear-Time Generation of Random Chordal Graphs
Recommended article: Q3155230
Recommended article: A Linear Recognition Algorithm for Cographs
Recommended article: Q3359786
Recommended article: Parallel coherent graph transformations
Recommended article: Linear-time minimal cograph editing
Recommended article: A simple linear time algorithm for cograph recognition
Recommended article: A faster parallel connectivity algorithm on cographs
Recommended article: Q4024325
Recommended article: A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs
description: scientific article