Constructing a minimum height elimination tree of a tree in linear time
From MaRDI portal
Publication:881880
DOI10.1016/j.ins.2007.02.002zbMath1116.68060OpenAlexW2095493537MaRDI QIDQ881880
Chong-Hui Shi, Chung-Hsien Hsu, Sheng-Lung Peng
Publication date: 18 May 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.02.002
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Vertex ranking of asteroidal triple-free graphs
- Minimizing elimination tree height can increase fill more than linearly
- Vertex rankings of chordal graphs and weighted trees
- Optimal node ranking of trees
- On a graph partition problem with application to VLSI layout
- Finding minimum height elimination trees for interval graphs in polynomial time
- Biconvex graphs: Ordering and algorithms
- On vertex ranking of a starlike graph
- Optimal node ranking of tree in linear time
- Ordered colourings
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- The Role of Elimination Trees in Sparse Factorization
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Rankings of Graphs
- Efficient algorithms for graphs with few \(P_4\)'s
- Optimal edge ranking of trees in linear time
This page was built for publication: Constructing a minimum height elimination tree of a tree in linear time
