Mohlo by se vám také líbit

Více informací o knize Graph Theory for Programmers

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 331 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer programming / software development Algorithms & data structures

• Plný název: Graph Theory for Programmers
• Podnázev: Algorithms for Processing Trees
• Autor: Victor N. Kasyanov, Vladimir A. Evstigneev
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 432
• EAN: 9780792364283
• ISBN: 0792364287
• ID: 01396457
• Nakladatelství: Springer Netherlands
• Hmotnost: 807 g
• Rozměry: 240 × 160 × 25 mm
• Rok vydání: 2000

Oblíbené z jiného soudku

---

---

---