On minimum edge ranking spanning trees

DOI10.1006/JAGM.2000.1143MaRDI QIDQ2729646zbMATH OpenOpenAlexFDO

Authors Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki

Publication date 23 July 2001

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2000.1143

zbMATH Keywords

minimum edge ranking spanning tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 975401
• Publication:4886041
• Minimum edge ranking spanning trees of split graphs
• Edge ranking of weighted trees
• On an edge ranking problem of trees and graphs

Cited in

(14)

• Conflict-free connections of graphs
• The binary identification problem for weighted trees
• Edge ranking of weighted trees
• On the tree search problem with non-uniform costs
• On the tree search problem with non-uniform costs
• Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
• scientific article; zbMATH DE number 1979519 (Why is no real title available?)
• Facial edge ranking of plane graphs
• The complexity of bicriteria tree-depth
• The complexity of bicriteria tree-depth
• Edge and pair queries-random graphs and complexity
• Minimum edge ranking spanning trees of split graphs
• NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
• Edge ranking and searching in partial orders

This page was built for publication: On minimum edge ranking spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729646)