On vertex ranking of a starlike graph

DOI10.1016/S0020-0190(01)00262-9zbMath1013.68141OpenAlexW2074764821MaRDI QIDQ1603539

Sun-Yuan Hsieh

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00262-9

zbMATH Keywords

algorithmssplit graphsvertex rankingstarlike graphs

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Constructing a minimum height elimination tree of a tree in linear time ⋮ Graphs with large rank numbers and rank numbers of subdivided stars ⋮ Minimal \(k\)-rankings and the rank number of \(P^2_n\) ⋮ Rank numbers of grid graphs ⋮ Minimal rankings and the arank number of a path ⋮ Max-optimal and sum-optimal labelings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On an edge ranking problem of trees and graphs
• The splittance of a graph
• On a graph partition problem with application to VLSI layout
• Optimal node ranking of tree in linear time
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• The Role of Elimination Trees in Sparse Factorization
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Algorithmic Aspects of Vertex Elimination on Graphs

This page was built for publication: On vertex ranking of a starlike graph