2463 search results - page 9 / 493 » Rankings of Directed Graphs |
IPL
2006
13 years 7 months ago
2006
: 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...
APWEB
2005
Springer
13 years 9 months ago
2005
Springer
In this paper, we will provide an overview of some of the more recent developments in web graph processing using the classic Google page rank equation as popularized by Brins and P...
COLING
2010
13 years 2 months ago
2010
WG
2010
Springer
13 years 5 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
IPPS
1998
IEEE
14 years 55 min ago
1998
IEEE
In the theoretical framework of graph embedding and network emulations, we show that the index-shuffle graph (a bounded-degreehypercube-like interconnection network, recently intr...