745 search results - page 75 / 149 » On Generating Random Network Structures: Connected Graphs |
113
Voted
PODC
1990
ACM
15 years 4 months ago
1990
ACM
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...
115
click to vote
JDA
2006
15 years 17 days ago
2006
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...
93
Voted
WWW
2003
ACM
16 years 1 months ago
2003
ACM
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...
99
Voted
KDD
2010
ACM
15 years 4 months ago
2010
ACM
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...
115
Voted
COR
2010
15 years 21 days ago
2010
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...