3008 search results - page 410 / 602 » Independence in connected graphs |
240
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
214
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, obje...
164
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
181
click to vote
AVI
2004
15 years 8 months ago
2004
Complex hypermedia structures can be difficult to author and maintain, especially when the usual hierarchic representation cannot capture important relations. We propose a graph-b...
199
click to vote
NIPS
2001
15 years 8 months ago
2001
This paper presents an unsupervised learning algorithm that can derive the probabilistic dependence structure of parts of an object (a moving human body in our examples) automatic...