𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications

✍ Scribed by Martin Charles Golumbic, Irith Ben-Arroyo Hartman

Publisher
Springer
Year
2005
Tongue
English
Leaves
296
Series
Operations Research / Computer Science Interfaces Series
Edition
1
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graph Theory, Combinatorics and Algorith
πŸ“ Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications
✍ Martin Charles Golumbic, Irith Ben-Arroyo Hartman πŸ“‚ Library πŸ“… 2005 πŸ› Springer 🌐 English

<P><STRONG><EM>Graph Theory, Combinatorics and Algorithms:</EM> <EM>Interdisciplinary Applications</EM> focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.Β The book containsΒ 

Graph Theory, Combinatorics and Algorith
πŸ“ Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications
✍ Golumbic, Martin Charles & Hartman, Irith Ben-Arroyo πŸ“‚ Library πŸ“… 2006 πŸ› Springer 🌐 English

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.Β The book containsΒ eleven chapters written by exp

Combinatorial Optimization: Theory and A
πŸ“ Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
✍ Bernhard Korte, Jens Vygen πŸ“‚ Library πŸ“… 2005 πŸ› Springer 🌐 English

This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by