3008 search results - page 217 / 602 » Independence in connected graphs |
183
click to vote
CVHI
2007
15 years 8 months ago
2007
: Several web sites and e-learning platforms require the access to graphs that carry significant meanings. Understanding and perceiving the graph of a mathematical function is impo...
171
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...
270
click to vote
JPDC
2007
15 years 6 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
179
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 −...
172
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...