Zobacz książki o podobnej tematyce

Więcej informacji o Graph Theory for Programmers

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 329 punkty

Opis

This introductory book treats algorithmic graph theory specifically for programmers. It explores some key ideas and basic algorithms in this large and rapidly growing field, and contains high-level and language-independent descriptions of methods and algorithms on trees, the most important type of graphs in programming and informatics. Readers are assumed to be familiar with the basics of graph theory, and programming. Audience: This volume will be of interest to researchers and specialists in programming, software engineering, data structure and information retrieval, and to mathematicians whose work involves algorithms, combinatorics, graph theory, operations research, and discrete optimization. The book can also be recommended as a text for graduate courses in computer science, electronics, telecommunications, and control engineering.

Szczegóły książki

Kategoria Książki po angielsku Computing & information technology Computer programming / software development Algorithms & data structures

• Pełny tytuł: Graph Theory for Programmers
• Podtytuł: Algorithms for Processing Trees
• Autor: Victor N. Kasyanov, Vladimir A. Evstigneev
• Język: Angielski
• Oprawa: Twarda
• Liczba stron: 432
• EAN: 9780792364283
• ISBN: 0792364287
• ID: 01396457
• Wydawca: Springer Netherlands
• Waga: 807 g
• Wymiary: 240 × 160 × 25 mm
• Rok wydania: 2000

Ulubione w innej kategorii

---

---

---