JGT
2008
13 years 4 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...
APPML
2010
13 years 4 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
13 years 6 months 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...