Sciweavers

2463 search results - page 1 / 493
» Rankings of Directed Graphs
Sort
View
DAM
2007
129views more  DAM 2007»
13 years 4 months ago
Easy and hard instances of arc ranking in directed graphs
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
Dariusz Dereniowski
CIKM
2004
Springer
13 years 10 months ago
Node ranking in labeled directed graphs
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
WAW
2007
Springer
159views Algorithms» more  WAW 2007»
13 years 11 months ago
Local Partitioning for Directed Graphs Using PageRank
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
WG
1998
Springer
13 years 9 months ago
Rankings of Directed Graphs
Jan Kratochvíl, Zsolt Tuza
IICS
2005
Springer
13 years 10 months ago
Distributed Calculation of PageRank Using Strongly Connected Components
We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated c...
Michael Brinkmeier