Sciweavers

3778 search results - page 474 / 756
» Representing Web Graphs
Sort
View
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
16 years 1 months ago
Rendezvous without coordinates
— We study minimalism in sensing and control by considering a multi-agent system in which each agent moves like a Dubins car and has a limited sensor that reports only the presen...
Jingjin Yu, Steven M. LaValle, Daniel Liberzon
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
16 years 28 days ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
DAGSTUHL
2007
15 years 8 months ago
A Deeper Investigation of PageRank as a Function of the Damping Factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spre...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
206
Voted
OPODIS
2004
15 years 8 months ago
Comparison of Failures and Attacks on Random and Scale-Free Networks
Abstract. It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on the...
Jean-Loup Guillaume, Matthieu Latapy, Cléme...
JDA
2006
184views more  JDA 2006»
15 years 6 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano