3958 search results - page 36 / 792 » Dynamic Graph Algorithms with Applications |
111
click to vote
KAIS
2010
15 years 29 days ago
2010
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
112
Voted
ALENEX
2007
15 years 4 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
121
click to vote
HPDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
116
click to vote
EOR
2008
15 years 2 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
114
click to vote
ER
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...