Three-in-a-tree in near linear time (Q5145012): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3034687855 / rank
 
Normal rank

Latest revision as of 20:37, 19 March 2024

scientific article; zbMATH DE number 7298327
Language Label Description Also known as
English
Three-in-a-tree in near linear time
scientific article; zbMATH DE number 7298327

    Statements

    Three-in-a-tree in near linear time (English)
    0 references
    0 references
    0 references
    0 references
    19 January 2021
    0 references
    0 references
    induced subgraph detection
    0 references
    SPQR-tree
    0 references
    dynamic graph algorithm
    0 references
    even hole
    0 references
    graph recognition
    0 references
    odd hole
    0 references
    perfect graph
    0 references
    top tree
    0 references
    0 references