On an edge ranking problem of trees and graphs

From MaRDI portal
Publication:803172

DOI10.1016/0166-218X(91)90012-LzbMath0727.05053MaRDI QIDQ803172

Gopalakrishnan Vijayan, H. Donald Ratliff, Ananth V. Iyer

Publication date: 1991

Published in: Discrete Applied Mathematics (Search for Journal in Brave)




Related Items

List rankings and on-line list rankings of graphs, On Dasgupta's hierarchical clustering objective and its relation to other graph parameters, On the tree search problem with non-uniform costs, Optimal edge ranking of trees in polynomial time, A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs, Minimum edge ranking spanning trees of split graphs, NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem, The complexity of restricted star colouring, Edge ranking of graphs is hard, \(l_p\)-optimal rankings and max-optimal rankings are different, Rankings of graphs, Finding the edge ranking number through vertex partitions, On the vertex ranking problem for trapezoid, circular-arc and other graphs, On the complexity of searching in trees and partially ordered structures, Improved approximation algorithms for the average-case tree searching problem, Easy and hard instances of arc ranking in directed graphs, Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes, Graphs with large rank numbers and rank numbers of subdivided stars, Optimal vertex ranking of block graphs, The binary identification problem for weighted trees, Edge ranking of weighted trees, Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs, The complexity of bicriteria tree-depth, The complexity of bicriteria tree-depth, Conflict-free connection of trees, On the Tree Search Problem with Non-uniform Costs, Algorithms for generalized vertex-rankings of partial k-trees, On vertex ranking of a starlike graph



Cites Work