Sciweavers

IPL
2006
87views more  IPL 2006»
14 years 13 days ago
Vertex rankings of chordal graphs and weighted trees
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
Dariusz Dereniowski, Adam Nadolski
DAM
2006
79views more  DAM 2006»
14 years 14 days ago
Edge ranking of weighted trees
: 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 m...
Dariusz Dereniowski