Sciweavers

SIAMCOMP
2002
95views more  SIAMCOMP 2002»
13 years 10 months ago
A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...
Francesco M. Malvestuto, Mauro Mezzini
IPL
2007
76views more  IPL 2007»
13 years 10 months ago
Minimum cost subpartitions in graphs
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
Hiroshi Nagamochi, Yoko Kamidoi