Sciweavers

745 search results - page 75 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
PODC
1990
ACM
15 years 7 months ago
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
Shlomi Dolev, Amos Israeli, Shlomo Moran
132
Voted
JDA
2006
184views more  JDA 2006»
15 years 2 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
WWW
2003
ACM
16 years 3 months ago
On the bursty evolution of blogspace
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, And...
KDD
2010
ACM
263views Data Mining» more  KDD 2010»
15 years 6 months ago
Social action tracking via noise tolerant time-varying factor graphs
Users’ behaviors (actions) in a social network are influenced by various factors such as personal interests, social influence, and global trends. However, few publications sys...
Chenhao Tan, Jie Tang, Jimeng Sun, Quan Lin, Fengj...
COR
2010
146views more  COR 2010»
15 years 3 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz