Edge ranking of weighted trees

Authors:
Dariusz Dereniowski
Affiliations:
Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 8
Cited 3

On an edge ranking problem of trees and graphs

Discrete Applied Mathematics
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree

Journal of Algorithms
Edge ranking of graphs is hard

Discrete Applied Mathematics
Optimal edge ranking of trees in linear time

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On minimum edge ranking spanning trees

Journal of Algorithms
Minimum Edge Ranking Spanning Trees of Threshold Graphs

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Generalized Edge-Ranking of Trees (Extended Abstract)

WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Parallel Query Processing by Graph Ranking

Fundamenta Informaticae

Vertex rankings of chordal graphs and weighted trees

Information Processing Letters
Easy and hard instances of arc ranking in directed graphs

Discrete Applied Mathematics
Edge ranking and searching in partial orders

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for multitrees with diameter at most 10. Note that the same problem but for trees is linearly solvable. We give an O(log n)-approximation polynomial time algorithm for edge ranking of weighted trees.