Graph Theory for Programmers: Algorithms for Processing Trees by Victor N. Kasya

Description: Graph Theory for Programmers by Victor N. Kasyanov, Vladimir A. Evstigneev In delivering lectures and writing books, we were most often forced to pay absolutely no attention to a great body of interesting results and useful algorithms appearing in numerous sources and occasionally encountered. FORMAT Hardcover LANGUAGE English CONDITION Brand New Publisher Description This introductory book treats algorithmic graph theory specifically for programmers. It explores some key ideas and basic algorithms in this 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. The volume should 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. Table of Contents 1. Basic Concepts and Algorithms.- 1. Trees and their Properties.- 2. Computational Models. Complexity and Fundamental Algorithms.- 3. Spanning Trees.- 2. Translation and Transformation of Programs.- 4. Structural Trees.- 5. Isomorphism, Unification, and Term-Rewriting Systems.- 6. Syntax Trees.- 3. Search and Storage of Information.- 7. Information Trees.- 8. Trees for Multilevel Memory.- Additional List of Literature. Promotional Springer Book Archives Long Description In delivering lectures and writing books, we were most often forced to pay absolutely no attention to a great body of interesting results and useful algorithms appearing in numerous sources and occasionally encountered. It was absolutely that most of these re Details ISBN0792364287 Author Vladimir A. Evstigneev Language English ISBN-10 0792364287 ISBN-13 9780792364283 Media Book Format Hardcover Series Number 515 Year 2000 Publication Date 2000-08-31 Subtitle Algorithms for Processing Trees Place of Publication Dordrecht Publisher Springer Short Title GRAPH THEORY FOR PROGRAMMERS 2 Pages 432 Imprint Springer Country of Publication Netherlands DOI 10.1023/b130853;10.1007/978-94-011-4122-2 Edition Description 2000 ed. Series Mathematics and Its Applications Edition 2000th Alternative 9789401058049 DEWEY 511.5 Illustrations X, 432 p. Audience Undergraduate We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:96264502;

Price: 220.33 AUD

Location: Melbourne

End Time: 2025-01-14T19:11:22.000Z

Shipping Cost: 26.04 AUD