Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs

DOI10.1007/978-3-031-27051-2_14arXiv2212.07119MaRDI QIDQ6091158

Yui Yoshioka, Hirokazu Takeda, Toshiki Saitoh, Jun Kawahara, Ryo Yoshinaka

Publication date: 24 November 2023

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

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

zbMATH Keywords

enumerationbinary decision diagramsstring representationgraph isomorphismgraph classes

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Random generation and enumeration of bipartite permutation graphs
• Subgraph isomorphism in graph classes
• Efficient graph representations
• Algorithmic graph theory and perfect graphs
• Enumeration of difference graphs
• Threshold graphs and related topics
• Reverse search for enumeration
• Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs
• Random Generation and Enumeration of Proper Interval Graphs
• Graph Classes: A Survey
• Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
• Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
• Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
• Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs

This page was built for publication: Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs