256 Pages
by
Chapman & Hall
256 Pages
by
Chapman & Hall
Also available as eBook on:
Topics include optimal branching problems, trans-shipment problems, shortest path problems, minimum cost flow problems, maximum flow problems, matching in bipartite and nonbipartite graphs, and applications to combinatorics.
Preface
Trees, arborescences and branchings
Transshipment problems
Shortest path problems
Minimum cost flow problems
Matching in graphs
References
Solutions to selected problems
Index
Trees, arborescences and branchings
Transshipment problems
Shortest path problems
Minimum cost flow problems
Matching in graphs
References
Solutions to selected problems
Index
Biography
Balakrishnan\, V.
