4865 search results - page 179 / 973 » The Complexity of Graph Connectivity |
216
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
This paper addresses recognition of human activities with stochastic structure, characterized by variable spacetime arrangements of primitive actions, and conducted by a variable ...
214
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
154
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...
156
click to vote
ISI
2007
Springer
16 years 19 days ago
2007
Springer
Graph data represents relationships, connections, or affinities. Innocent relationships produce repeated, and so common, substructures in graph data. We present techniques for dis...
175
click to vote
SPAA
2005
ACM
16 years 1 days ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...