Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes
From MaRDI portal
Publication:6549667
DOI10.1016/j.tcs.2024.114591zbMATH Open1541.05173MaRDI QIDQ6549667
Yui Yoshioka, Ryo Yoshinaka, T. Saitoh, Hirokazu Takeda, Jun Kawahara
Publication date: 4 June 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- On the OBDD representation of some graph classes
- Random generation and enumeration of bipartite permutation graphs
- Subgraph isomorphism in graph classes
- Interval scheduling and colorful independent sets
- Representation of graphs by OBDDs
- A partial k-arboretum of graphs with bounded treewidth
- Efficient graph representations
- Algorithmic graph theory and perfect graphs
- Enumeration of difference graphs
- Threshold graphs and related topics
- Reverse search for enumeration
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs
- Succinct data structures for families of interval graphs
- OBDD-Based Representation of Interval Graphs
- Counting 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
- Reconfiguring Independent Sets on Interval Graphs
- Complexity of maximum cut on interval graphs
- Computing the Tutte polynomial of a graph of moderate size
This page was built for publication: Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes
