245 search results - page 33 / 49 » Group connectivity of graphs with diameter at most 2 |
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Much past research on finding text in natural scenes uses bottom-up grouping processes to detect candidate text features as a first processing step. While such grouping procedures...
ICITS
2011
12 years 11 months ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
BIODATAMINING
2008
13 years 7 months ago
2008
The analysis and interpretation of relationships between biological molecules, networks and concepts is becoming a major bottleneck in systems biology. Very often the pure amount ...