A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Laplacian spectrum of weakly quasi-threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Linear Time LexBFS Cograph Recognition Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations for co-graphs defined by restricted NLC-width or clique-width operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for cograph recognition / rank
 
Normal rank

Latest revision as of 20:23, 4 July 2024

scientific article
Language Label Description Also known as
English
A simple linear-time recognition algorithm for weakly quasi-threshold graphs
scientific article

    Statements

    A simple linear-time recognition algorithm for weakly quasi-threshold graphs (English)
    0 references
    24 January 2012
    0 references
    Weakly quasi-threshold graphs
    0 references
    Cographs
    0 references
    Forbidden induced subgraphs
    0 references
    Recognition
    0 references
    Linear-time algorithms
    0 references

    Identifiers