4865 search results - page 289 / 973 » The Complexity of Graph Connectivity |
157
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We propose a model for the World Wide Web graph that couples the topological growth with the traffic's dynamical evolution. The model is based on a simple traffic-driven dynam...
196
click to vote
CSL
2007
Springer
16 years 25 days ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
198
click to vote
WAOA
2005
Springer
16 years 4 days ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
184
click to vote
WG
2005
Springer
16 years 4 days ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
153
Voted
DSD
2010
IEEE
15 years 6 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...