Sciweavers

5607 search results - page 54 / 1122
» Graph structure in the Web
Sort
View
WWW
2007
ACM
16 years 5 months ago
A link classification based approach to website topic hierarchy generation
Hierarchical models are commonly used to organize a Website's content. A Website's content structure can be represented by a topic hierarchy, a directed tree rooted at a...
Nan Liu, Christopher C. Yang
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 3 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
IM
2008
15 years 4 months ago
Directed Random Dot Product Graphs
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
Stephen J. Young, Edward R. Scheinerman
CIKM
2004
Springer
15 years 9 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
COMBINATORICA
2006
70views more  COMBINATORICA 2006»
15 years 4 months ago
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements
In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G i...
Michele Conforti, Gérard Cornuéjols,...