Ancien livre de biblioth�que. Traces d'usure sur la couverture. Edition 1984. Tome 2. Ammareal reverse jusqu'� 15% du prix net de cet article � des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Signs of wear on the cover. Edition 1984. Volume 2. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo E-867-919

Contatta il venditore

Segnala questo articolo

Dati bibliografici

Titolo: Data Structures and Algorithms 2: Graph ...

Casa editrice: Springer-Verlag Berlin and Heidelberg GmbH & Co. K

Data di pubblicazione: 1984

Legatura: Hardcover

Condizione: Bon

Descrizione articolo

Contenuti:

Vol. 2: Graph Algorithms and NP-Completeness.- IV. Algorithms on Graphs.- 1. Graphs and their Representation in a Computer.- 2. Topological Sorting and the Representation Problem.- 3. Transitive Closure of Acyclic Digraphs.- 4. Systematic Exploration of a Graph.- 5. A Close Look at Depth First Search.- 6. Strongly-Connected and Biconnected Components of Directed and Undirected Graphs.- 7. Least Cost Paths in Networks.- 7.1. Acyclic Networks.- 7.2. Non-negative Networks.- 7.3. General Networks.- 7.4. The All Pairs Problem.- 8. Minimum Spanning Trees.- 9. Maximum Network Flow and Applications.- 9.1 Algorithms for Maximum Network Flow.- 9.2 (0,1)-Networks, Bipartite Matching and Graph Connectivity.- 9.3 Weighted Network Flow and Weighted Bipartite Matching.- 10. Planar Graphs.- 11. Exercises.- 12. Bibliographic Notes.- V. Path Problems in Graphs and Matrix Multiplication.- 1. General Path Problems.- 2. Two Special Cases: Least Cost Paths and Transitive Closure.- 3. General Path Problems and Matrix Multiplication.- 4. Matrix Multiplication in a Ring.- 5. Boolean Matrix Multiplication and Transitive Closure.- 6. (Min,+)-Product of Matrices and Least Cost Paths.- 7. A Lower Bound on the Monotone Complexity of Matrix Multiplication.- 8. Exercises.- 9. Bibliographic Notes.- VI. NP-Completeness.- 1. Turing Machines and Random Access Machines.- 2. Problems, Languages and Optimization Problems.- 3. Reductions and NP-complete Problems.- 4. The Satisfiability Problem is NP-complete.- 5. More NP-complete Problems.- 6. Solving NP-complete Problems.- 6.1 Dynamic Programming.- 6.2 Branch and Bound.- 7. Approximation Algorithms.- 7.1 Approximation Algorithms for the Travelling Salesman Problem.- 7.2 Approximation Schemes.- 7.3 Full Approximation Schemes.- 8. The Landscape of Complexity Classes.- 9. Exercises.- 10. Bibliographic Notes.- IX. Algorithmic Paradigms.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

English below. Ammareal est une librairie professionnelle sp�cialis�e dans le livre d?occasion. Nous exp�dions partout dans le monde. Nous avons plus de 250 000 ouvrages en stock dont un grand nombre de livres techniques et acad�miques. Nous reversons jusqu?� 15% du prix de vente de chaque livre � des organisations caritatives, des biblioth�ques et des associations luttant contre l?illettrisme. Ce que nous ne vendons pas nous le donnons, ce que nous ne donnons pas nous le recyclons. Ammareal is a professional bookseller speciliazed in used books. We ship worldwide. We have more than 250 000 books in stock, including a large number of technical and university-level books. We give back up to 15% of the price of each book to charities, libraries and organizations fighting in favor of literacy. What we do not sell, we give, what we do not give we recycle.

Visita la pagina della libreria