Sciweavers

2463 search results - page 3 / 493
» Rankings of Directed Graphs
Sort
View
WEBI
2005
Springer
13 years 11 months ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...
IMCSIT
2010
13 years 3 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
Michal Klisowski, Vasyl Ustimenko
ICML
2007
IEEE
14 years 6 months ago
Learning random walks to rank nodes in graphs
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
Alekh Agarwal, Soumen Chakrabarti
EJC
2008
13 years 5 months ago
Graph parameters and semigroup functions
Abstract. We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness (`reflection posit...
László Lovász, Alexander Schr...
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
14 years 5 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu