An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437)

From MaRDI portal
Revision as of 19:11, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs
scientific article

    Statements

    An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 July 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Graph
    0 references
    Recognition algorithm
    0 references
    hhds-free
    0 references
    Perfectly orderable
    0 references