Treewidth and minimum fill-in on permutation graphs in linear time (Q708222): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Minimum Fill-in on d-Trapezoid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pathwidth and Treewidth of Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Minimum Fill-in: Grouping the Minimal Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing all potential maximal cliques of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Arrangement of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of cocomparability graphs and a new order-theoretic parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: On treewidth and minimum fill-in of asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating graphs without asteroidal triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and algorithmic applications of chordal graph embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank

Latest revision as of 08:10, 3 July 2024

scientific article
Language Label Description Also known as
English
Treewidth and minimum fill-in on permutation graphs in linear time
scientific article

    Statements

    Treewidth and minimum fill-in on permutation graphs in linear time (English)
    0 references
    0 references
    11 October 2010
    0 references
    graph algorithms
    0 references
    treewidth
    0 references
    minimal triangulation
    0 references
    linear time
    0 references
    permutation graphs
    0 references
    interval graphs
    0 references

    Identifiers