Optimal vertex ranking of block graphs
type: Item
instance of: scholarly article
title: Optimal vertex ranking of block graphs
zbMATH Open document ID: 1169.68038
author: Ruo-Wei Hung
published in: Information and Computation
publication date: 2008-12-03T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5377241
zbMATH Keywords: graph algorithms
zbMATH Keywords: vertex ranking
zbMATH Keywords: edge ranking
zbMATH Keywords: trees
zbMATH Keywords: block graphs
MaRDI profile type: Publication
full work available at URL: j.ic.2008.08.001
OpenAlex ID: W2020964097
cites work: Q4773298
cites work: Finding minimum height elimination trees for interval graphs in polynomial time
cites work: Rankings of Graphs
cites work: Optimal edge ranking of trees in polynomial time
cites work: Q5284078
cites work: Q4942652
cites work: On the vertex ranking problem for trapezoid, circular-arc and other graphs
cites work: Vertex rankings of chordal graphs and weighted trees
cites work: Bandwidth and density for block graphs
cites work: Optimal node ranking of trees
cites work: On an edge ranking problem of trees and graphs
cites work: Ordered colourings
cites work: Vertex ranking of asteroidal triple-free graphs
cites work: Edge ranking of graphs is hard
cites work: Optimal edge ranking of trees in linear time
cites work: The Role of Elimination Trees in Sparse Factorization
cites work: Local optimization on graphs
cites work: Q3958504
cites work: Optimal node ranking of tree in linear time
cites work: Q3326832
cites work: Optimal path cover problem on block graphs
cites work: Q4886041
DOI: 10.1016/J.IC.2008.08.001
description: scientific article; zbMATH DE number 5377241