245 search results - page 12 / 49 » Group connectivity of graphs with diameter at most 2 |
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
We describe a part-based object-recognition framework, specialized to mining complex 3D objects from detailed 3D images. Objects are modeled as a collection of parts together with...
APPML
2005
13 years 7 months ago
2005
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
WAW
2010
Springer
13 years 5 months ago
2010
Springer
Large scale real-world network data such as social and information networks are ubiquitous. The study of such social and information networks seeks to find patterns and explain th...
WG
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...