4865 search results - page 287 / 973 » The Complexity of Graph Connectivity |
172
click to vote
SDM
2010
SIAM
15 years 8 months ago
2010
SIAM
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
183
click to vote
DM
1998
15 years 6 months ago
1998
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
174
click to vote
JMIV
2008
15 years 6 months ago
2008
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...
175
click to vote
TACAS
1997
Springer
15 years 10 months ago
1997
Springer
We present a highly polymorphic tool for the construction, synthesis, structuring, manipulation, investigation, and (symbolic) execution of graphs. The exibility of this tool, whic...
167
click to vote
APVIS
2007
15 years 8 months ago
2007
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit ...