Optimal vertex ranking of block graphs

DOI10.1016/j.ic.2008.08.001zbMath1169.68038OpenAlexW2020964097MaRDI QIDQ958305

Ruo-Wei Hung

Publication date: 3 December 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.08.001

zbMATH Keywords

treesgraph algorithmsvertex rankingblock graphsedge ranking

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

On computing a minimum secure dominating set in block graphs ⋮ Rank numbers of grid graphs ⋮ The pos/neg-weighted median problem on block graphs with subgraph-shaped customers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex ranking of asteroidal triple-free graphs
• On an edge ranking problem of trees and graphs
• Vertex rankings of chordal graphs and weighted trees
• Optimal node ranking of trees
• Local optimization on graphs
• Finding minimum height elimination trees for interval graphs in polynomial time
• Edge ranking of graphs is hard
• Bandwidth and density for block graphs
• Optimal node ranking of tree in linear time
• Optimal edge ranking of trees in polynomial time
• Ordered colourings
• Optimal path cover problem on block graphs
• On the vertex ranking problem for trapezoid, circular-arc and other graphs
• The Role of Elimination Trees in Sparse Factorization
• Rankings of Graphs
• Optimal edge ranking of trees in linear time

This page was built for publication: Optimal vertex ranking of block graphs