Minimum edge ranking spanning trees of split graphs
From MaRDI portal
Publication:860397
DOI10.1016/j.dam.2006.04.018zbMath1142.68054OpenAlexW2046384546MaRDI QIDQ860397
Toshihide Ibaraki, Kazuhisa Makino, Yushi Uno
Publication date: 9 January 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.018
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On an edge ranking problem of trees and graphs
- The splittance of a graph
- Edge ranking of graphs is hard
- Optimal edge ranking of trees in polynomial time
- Threshold graphs and related topics
- On Minimum Edge Ranking Spanning Trees
- Threshold Sequences
- Rankings of Graphs
- Optimal edge ranking of trees in linear time
- Fairness in routing and load balancing