Minimum cut bases in undirected networks

Given an undirected, connected network G = ( V , E ) with weights on the edges, the cut basis problem is asking for a maximal number of linear independent cuts such that the sum of the cut weights is minimized. Surprisingly, this problem has not attained as much attention as another graph theoretic...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 158; číslo 4; s. 277 - 290
Hlavní autori:	Bunke, Florentine, Hamacher, Horst W., Maffioli, Francesco, Schwahn, Anne M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 28.02.2010
Predmet:	Cut basis problem Graph and network algorithms Integer programming Integer programming Graph and network algorithms Cut basis problem
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!