4865 search results - page 483 / 973 » The Complexity of Graph Connectivity |
374
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
145
click to vote
CVPR
1999
IEEE
16 years 9 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
135
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
198
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
156
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
In this work, we present an algorithm for simultaneous template generation and matching. The algorithm profiles the graph and iteratively contracts edges to create the templates. ...