An edition of Programming in Networks and Graphs
(1988)
Programming in Networks and Graphs
On The Combinatorial Background And Near-Equivalence Of Network Flow And Matching Algorithms
by Ulrich Derigs
Share
×Close
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Subjects
Network analysis (planning)| Edition | Availability |
|---|---|
1
Programming in Networks and Graphs: On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms
Mar 12, 2014, Springer
paperback
3642517145 9783642517143
|
zzzz
|
2
Programming in Networks and Graphs: On the Combinatorial Background and near-Equivalence of Network Flow and Matching Algorithms
2013, Springer London, Limited
in English
3642517137 9783642517136
|
zzzz
|
3
Programming in Networks and Graphs: On The Combinatorial Background And Near-Equivalence Of Network Flow And Matching Algorithms
May 17, 1988, Springer
paperback
3540189696 9783540189695
|
aaaa
|
Book Details
Edition Notes
Source title: Programming in Networks and Graphs: On The Combinatorial Background And Near-Equivalence Of Network Flow And Matching Algorithms (Lecture Notes in Economics and Mathematical Systems)
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Source records
Community Reviews (0)
Lists
History
- Created May 6, 2020
- 2 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| February 25, 2022 | Edited by ImportBot | import existing book |
| May 6, 2020 | Created by ImportBot | Imported from amazon.com record |