3008 search results - page 355 / 602 » Independence in connected graphs |
190
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that th...
171
click to vote
ICFEM
2009
Springer
15 years 5 months ago
2009
Springer
We present the integration of refinement method of VSE verification tool, successfully used in industrial applications, in the Heterogeneous Tool Set HETS. The connection is done v...
180
Voted
WWW
2009
ACM
16 years 8 months ago
2009
ACM
We demonstrate a flight meta-search engine that is based on the Metamorph framework. Metamorph provides mechanisms to model web forms together with the interactions which are need...
188
Voted
SPAA
2004
ACM
16 years 27 days ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
249
Voted
ICALP
2001
Springer
15 years 12 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...