JGT
2008
14 years 10 months ago
2008
: A (g, f )-factor of a graph is a subset F of E such that for all v V, g(v) degF(v) f(v). Lovasz gave a necessary and sufficient condition for the existence of a (g, f )-factor...
77
Voted
APPML
2010
14 years 11 months ago
2010
We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and "ultrasimilarities", and we discus...
DGCI
2008
Springer
15 years 17 days ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...