Sciweavers

2463 search results - page 154 / 493
» Rankings of Directed Graphs
Sort
View
TOG
2002
108views more  TOG 2002»
13 years 9 months ago
Motion graphs
In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a mo...
Lucas Kovar, Michael Gleicher, Frederic H. Pighin
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 11 months ago
On external memory graph traversal
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...
Adam L. Buchsbaum, Michael H. Goldwasser, Suresh V...
WWW
2009
ACM
14 years 10 months ago
Analysis of community structure in Wikipedia
We present the results of a community detection analysis of the Wikipedia graph. Distinct communities in Wikipedia contain semantically closely related articles. The central topic...
Dmitry Lizorkin, Olena Medelyan, Maria P. Grineva
WIOPT
2010
IEEE
13 years 8 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
WADS
2007
Springer
82views Algorithms» more  WADS 2007»
14 years 3 months ago
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
Prosenjit Bose, Paz Carmi, Mathieu Couture, Michie...