3267 search results - page 185 / 654 » Generalized quasirandom graphs |
231
click to vote
APPROX
2000
Springer
15 years 11 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
178
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
157
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
145
click to vote
TASE
2008
IEEE
16 years 29 days ago
2008
IEEE
Symmetry reduction holds great promise to counter the state explosion problem. However, currently it is “conducting a life on the fringe”, and is not widely applied, mainly du...
161
click to vote
HPDC
2007
IEEE
16 years 27 days ago
2007
IEEE
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...