$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs (Q4842112)

From MaRDI portal
Revision as of 17:49, 10 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 779127
Language Label Description Also known as
English
$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
scientific article; zbMATH DE number 779127

    Statements

    $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs (English)
    0 references
    20 February 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    circular-arc graphs
    0 references
    PQ-tree
    0 references