On Linear Recognition of Tree-Width at Most Four (Q4875439): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 05:42, 8 February 2024

scientific article; zbMATH DE number 869826
Language Label Description Also known as
English
On Linear Recognition of Tree-Width at Most Four
scientific article; zbMATH DE number 869826

    Statements

    On Linear Recognition of Tree-Width at Most Four (English)
    0 references
    0 references
    29 September 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    linear recognition
    0 references
    graph algorithm
    0 references
    NP-hard
    0 references
    tree-width
    0 references
    linear time complexity
    0 references
    \(k\)-elimination sequence
    0 references
    linear time algorithm
    0 references