Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (Q2232254): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-68211-8_23 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3131940099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of ptolemaic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient enumeration of non-isomorphic interval 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: Efficient enumeration of non-isomorphic Ptolemaic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laminar structure of ptolemaic graphs with applications / 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 18:11, 26 July 2024

scientific article
Language Label Description Also known as
English
Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs
scientific article

    Statements

    Identifiers