4865 search results - page 259 / 973 » The Complexity of Graph Connectivity |
154
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
155
click to vote
PVLDB
2010
15 years 4 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
155
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
190
click to vote
Publication
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
144
click to vote
INFOVIS
2003
IEEE
15 years 11 months ago
2003
IEEE
Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed ...