Constructing a minimum height elimination tree of a tree in linear time (Q881880): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Biconvex graphs: Ordering and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing elimination tree height can increase fill more than linearly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum height elimination trees for interval graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for graphs with few \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex ranking problem for trapezoid, circular-arc and other graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex rankings of chordal graphs and weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex ranking of a starlike graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex ranking of asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal edge ranking of trees in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Role of Elimination Trees in Sparse Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of tree in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph partition problem with application to VLSI layout / rank
 
Normal rank

Latest revision as of 19:35, 25 June 2024

scientific article
Language Label Description Also known as
English
Constructing a minimum height elimination tree of a tree in linear time
scientific article

    Statements

    Constructing a minimum height elimination tree of a tree in linear time (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2007
    0 references
    0 references
    trees
    0 references
    vertex ranking
    0 references
    elimination trees
    0 references
    graph algorithms
    0 references
    0 references