4865 search results - page 213 / 973 » The Complexity of Graph Connectivity |
138
click to vote
ALGORITHMICA
2007
15 years 4 months ago
2007
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...
171
click to vote
ICDAR
2011
IEEE
14 years 3 months ago
2011
IEEE
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
152
click to vote
EDBT
2012
ACM
13 years 6 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
119
click to vote
CCCG
2010
15 years 5 months ago
2010
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...