Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs (Q6091158): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph isomorphism in graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of difference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation and enumeration of bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Generation and Enumeration of Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs / rank
 
Normal rank

Latest revision as of 14:24, 19 August 2024

scientific article; zbMATH DE number 7770289
Language Label Description Also known as
English
Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs
scientific article; zbMATH DE number 7770289

    Statements

    Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2023
    0 references
    enumeration
    0 references
    binary decision diagrams
    0 references
    graph isomorphism
    0 references
    graph classes
    0 references
    string representation
    0 references

    Identifiers