1206 search results - page 96 / 242 » Arc-Flags in Dynamic Graphs |
97
Voted
GD
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
160
Voted
HCW
1999
IEEE
15 years 8 months ago
1999
IEEE
A framework for task assignment in heterogeneous computing systems is presented in this work. The framework is based on a learning automata model. The proposed model can be used f...
146
Voted
IJICT
2007
15 years 3 months ago
2007
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...
111
click to vote
ECBS
2008
IEEE
15 years 10 months ago
2008
IEEE
Network designers perform challenging tasks with so many configuration options that it is often hard or even impossible for a human to predict all potentially dangerous situation...
127
Voted
WG
2004
Springer
15 years 9 months ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...