Premium
Balanced network flows. IV. Duality and structure theory
Author(s) -
FremuthPaeger Christian,
Jungnickel Dieter
Publication year - 2001
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.1013
Subject(s) - duality (order theory) , graph theory , factor (programming language) , decomposition , network theory , mathematical economics , mathematics , computer science , graph , discrete mathematics , combinatorics , ecology , biology , programming language
In this paper, we present a theory for generalized graph factor problems which is basically equivalent to Chapter 10 in Lovasz/Plummer [8] but considerably more intuitive since it uses the language of balanced network flows. The highlights are extensions of the Gallai—Edmonds decomposition and an intuitive development of Lovasz's factor theorem. © 2001 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom