Vertex rankings of chordal graphs and weighted trees
DOI10.1016/J.IPL.2005.12.006zbMATH Open1187.68340OpenAlexW2009372021WikidataQ56767305 ScholiaQ56767305MaRDI QIDQ844166FDOQ844166
Dariusz Dereniowski, Adam Nadolski
Publication date: 18 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.12.006
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05)
Cites Work
- Incidence matrices and interval graphs
- Rankings of Graphs
- On rigid circuit graphs
- Finding minimum height elimination trees for interval graphs in polynomial time
- The Role of Elimination Trees in Sparse Factorization
- Edge ranking of weighted trees
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
Cited In (12)
- On the size of minimal separators for treedepth decomposition
- On vertex rankings of graphs and its relatives
- Rank numbers of grid graphs
- Optimal vertex ranking of block graphs
- Minimal \(k\)-rankings and the rank number of \(P^2_n\)
- NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
- Constructing a minimum height elimination tree of a tree in linear time
- Rank inequalities for chordal graphs
- Graphs with large rank numbers and rank numbers of subdivided stars
- Title not available (Why is that?)
- The complexity of bicriteria tree-depth
- The complexity of bicriteria tree-depth
This page was built for publication: Vertex rankings of chordal graphs and weighted trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844166)
