Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
Preface. Part 1: Basic Concepts and Algorithms. 1. Trees and Their Properties. 2. Computational Models. Complexity and Fundamental Algorithms. 3. Spanning Trees. Part 2: Translation and Transformation of Programs. 4. Structural Trees. 5. Isomorphism, Unification, and Term-Rewriting Systems. 6. Syntax Trees. Part 3: Search and Storage of Information. 7. Information Trees. 8. Trees for Multilevel Memory. Additional List of Literature. Subject Index.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Graph Theory for Programmers: Algorithms for Processing...
Foto dell'editore
Graph Theory for Programmers - Algorithms for Processing Trees (MATHEMATICS AND ITS APPLICATIONS Volume 515)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2416190183747
Compra nuovo
EUR 102,78
EUR 3,40 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Graph Theory for Programmers : Algorithms for Processing Trees
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 756589-n
Compra nuovo
EUR 103,96
EUR 2,25 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Graph Theory for Programmers - Algorithms for Processing Trees (MATHEMATICS AND ITS APPLICATIONS Volume 515)
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Codice articolo Z1-R-024-02119
Compra usato
EUR 112,61
EUR 12,12 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Graph Theory for Programmers
Editore:
Springer Netherlands Aug 2000, 2000
ISBN 10: 0792364287
ISBN 13: 9780792364283
Nuovo
Rilegato
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 452 pp. Englisch. Codice articolo 9780792364283
Compra nuovo
EUR 106,99
EUR 23,00 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Graph Theory for Programmers : Algorithms for Processing Trees
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 756589-n
Compra nuovo
EUR 123,04
EUR 17,08 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Graph Theory for Programmers
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 . Codice articolo 5969414
Compra nuovo
EUR 92,27
EUR 48,99 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Graph Theory for Programmers: Algorithms for Processing Trees
Print on DemandDa: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 837. Codice articolo C9780792364283
Compra nuovo
EUR 135,59
EUR 21,78 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Graph Theory for Programmers | Algorithms for Processing Trees
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Graph Theory for Programmers | Algorithms for Processing Trees | Vladimir A. Evstigneev (u. a.) | Buch | x | Englisch | 2000 | Springer | EAN 9780792364283 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Codice articolo 102549990
Compra nuovo
EUR 95,80
EUR 70,00 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili
Immagini fornite dal venditore
Graph Theory for Programmers
Editore:
Springer Netherlands, Springer Netherlands Aug 2000, 2000
ISBN 10: 0792364287
ISBN 13: 9780792364283
Nuovo
Rilegato
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 452 pp. Englisch. Codice articolo 9780792364283
Compra nuovo
EUR 106,99
EUR 60,00 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Graph Theory for Programmers : Algorithms for Processing Trees
Editore:
Springer Netherlands, Springer Netherlands, 2000
ISBN 10: 0792364287
ISBN 13: 9780792364283
Nuovo
Rilegato
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9780792364283
Compra nuovo
EUR 114,36
EUR 64,20 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili