Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Graph Theory for Programmers - Victor N. Kasyanov, Vladimir A. Evstigneev

Graph Theory for Programmers

Algorithms for Processing Trees
Buch | Softcover
432 Seiten
2012
Springer (Verlag)
978-94-010-5804-9 (ISBN)
CHF 149,75 inkl. MwSt
  • Versand in 10-15 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
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­ sults would finally be forgotten because it is impossible to run through the entire variety of sources where these materials could be published. Therefore, we decided to do what we can to correct this situation. We discussed this problem with Ershov and came to an idea to write an encyclopedia of algorithms on graphs focusing our main attention on the algorithms already used in programming and their generalizations or modifications. We thought that it is reasonable to group all graphs into certain classes and place the algo­ rithms developed for each class into a separate book. The existence of trees, i. e. , a class of graphs especially important for programming, also supported this decision. This monograph is the first but, as we hope, not the last book written as part of our project. It was preceded by two books "Algorithms on Trees" (1984) and "Algorithms of Processing of Trees" (1990) small editions of which were published at the Computer Center of the Siberian Division of the Russian Academy of Sciences. The books were distributed immediately and this made out our decision to prepare a combined mono­ graph on the basis of these books even stronger.

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.

Reihe/Serie Mathematics and Its Applications ; 515
Mathematics and Its Applications ; 515
Zusatzinfo X, 432 p.
Verlagsort Dordrecht
Sprache englisch
Maße 160 x 240 mm
Themenwelt Mathematik / Informatik Informatik Software Entwicklung
Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Analysis
Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Finanz- / Wirtschaftsmathematik
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
ISBN-10 94-010-5804-0 / 9401058040
ISBN-13 978-94-010-5804-9 / 9789401058049
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15