Sciweavers

1736 search results - page 87 / 348
» The rank-width of Directed Graphs
Sort
View
SPIRE
2009
Springer
15 years 10 months ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
CCR
1998
96views more  CCR 1998»
15 years 3 months ago
On routes and multicast trees in the Internet
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
Jean-Jacques Pansiot, Dominique Grad
TC
1998
15 years 3 months ago
Optimal Elections in Faulty Loop Networks and Applications
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
Bernard Mans, Nicola Santoro
127
Voted
SIGIR
2008
ACM
15 years 3 months ago
Pagerank based clustering of hypertext document collections
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
Konstantin Avrachenkov, Vladimir Dobrynin, Danil N...
ML
2011
ACM
179views Machine Learning» more  ML 2011»
14 years 11 months ago
Neural networks for relational learning: an experimental comparison
In the last decade, connectionist models have been proposed that can process structured information directly. These methods, which are based on the use of graphs for the representa...
Werner Uwents, Gabriele Monfardini, Hendrik Blocke...