A01=V. Balakrishnan
Admissible Arcs
advanced network analysis
algorithmic graph models
Artificial Arc
Author_V. Balakrishnan
Backward Arc
Bipartite Graph
Category=PBU
Category=PBW
Category=UYA
combinatorial algorithms for flow problems
combinatorial optimization
computational complexity
Cost Vector
discrete mathematics
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Eulerian Circuit
Feasible Flow
Forward Arc
graph theory applications
Hamiltonian Cycle
Hamiltonian Path
Intermediate Vertices
Left Vertex
Matched Edge
Max Flow Min Cut Theorem
Maximum Cardinality Matching
MCFP
MFP
Minimum Cost Flow
Minimum Cut
network simplex algorithm
nonbipartite graphs
Odd Cycle
optimization techniques
Outer Vertex
SP Problem
Steiner Tree
Transshipment Problem
TU
Product details
- ISBN 9780412556708
- Weight: 453g
- Dimensions: 156 x 234mm
- Publication Date: 01 Apr 1995
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
Balakrishnan\, V.
