Cograph generation with linear delay

DOI10.1016/j.tcs.2017.12.037zbMath1387.05253arXiv1612.05827OpenAlexW2585040531MaRDI QIDQ1694670

Fábio Protti, Átila A. Jones, Renata R. Del-Vecchio

Publication date: 6 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.05827

zbMATH Keywords

cographsenumerative combinatoricsenumerative algorithms

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Exploring symmetries in cographs: obtaining spectra and energies

Cites Work

• Unnamed Item
• Unnamed Item
• Linear delay enumeration and monadic second-order logic
• Complement reducible graphs
• Classes of perfect graphs
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• A search strategy for the elementary cycles of a directed graph
• Database Programming Languages