Editore: Eigenverlag der Autoren / Jena, 1999
Da: Akademische Buchhandlung Antiquariat, Freiberg, Germania
Membro dell'associazione: BOEV
Prima edizione
EUR 9,38
Quantità: 1 disponibili
Aggiungi al carrelloSoftcover. Condizione: Gut bis sehr gut. Schutzumschlag. 1. Auflage. 156 S., TB , Umschlag minimalst lädiert , ex libris von Stoyan vorn , Widmung eines der Autoren an Fam. Stoyan.
paperback. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 53,68
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 60,74
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Condizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,62
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,62
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,62
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 57,10
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: Chiron Media, Wallingford, Regno Unito
EUR 57,19
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 74,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 60,14
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 60,14
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 66,74
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Condizione: New. pp. 492.
Condizione: New.
Lingua: Inglese
Editore: Springer-Verlag New York Inc, 2008
ISBN 10: 3540748385 ISBN 13: 9783540748380
Da: Revaluation Books, Exeter, Regno Unito
EUR 80,65
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 1st edition. 341 pages. 9.00x6.00x1.00 inches. In Stock.
Lingua: Inglese
Editore: Springer-Verlag New York Inc, 2014
ISBN 10: 3319123394 ISBN 13: 9783319123394
Da: Revaluation Books, Exeter, Regno Unito
EUR 81,53
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 2014 edition. 436 pages. 9.25x6.10x0.94 inches. In Stock.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2007
ISBN 10: 3540748385 ISBN 13: 9783540748380
Da: moluna, Greven, Germania
EUR 64,08
Quantità: Più di 20 disponibili
Aggiungi al carrelloKartoniert / Broschiert. Condizione: New. This book constitutes the thoroughly refereed post-proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007, held in Dornburg, Germany, in June 2007. The 30 revised full papers presented together with one in.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2012
ISBN 10: 3642265669 ISBN 13: 9783642265662
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP complete problems. Most likely there are no polynomial time al gorithms solving these hard problems and in the worst case scenario the exponential running time is unavoidable. Every combinatorial problem is solvable in nite time by enumerating all possi ble solutions, i. e. by brute force search. But is brute force search always unavoid able De nitely not. Already in the nineteen sixties and seventies it was known that some NP complete problems can be solved signi cantly faster than by brute force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING.
Lingua: Inglese
Editore: Springer International Publishing, Springer International Publishing, 2014
ISBN 10: 3319123394 ISBN 13: 9783319123394
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the thoroughly refereed post-conference proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, held in Nouan-le-Fuzelier, France, in June 2014.The 32 revised full papers presented were carefully reviewed and selected from 80 submissions. The book also includes two invited papers. The papers cover a wide range of topics in graph theory related to computer science, such as design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; structural graph theory with algorithmic or complexity applications; computational complexity of graph and network problems; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; computational geometry; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2005
ISBN 10: 3540310002 ISBN 13: 9783540310006
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - The 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005) was held on the campus Ile du Saulcy of the Univ- sity Paul Verlaine-Metz in France. The workshop was organized by the La- ratoire d Informatique Th eorique et Appliqu ee (LITA) and it took place June 23 25 2005. The 94 participants of WG 2005 came from universities and - search institutes of 18 di erent countries. The WG 2005 workshop continues the series of 30 previous WG workshops. Since 1975,WG has taken place 20 times in Germany, four times in The Neth- lands,twotimesinAustriaaswellasonceinItaly,inSlovakia,inSwitzerlandand inCzechRepublic, andhas nowbeen heldfor the rsttime inFrance.The wo- shop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The talks were given in the Petit Th eatre . They showed how recent research results from algori- mic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science. There were two fascinating invited lectures by Georg Gottlob (Vienna, Austria) and Gregory Kucherov (Nancy, France).
Da: preigu, Osnabrück, Germania
EUR 50,25
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Graph-Theoretic Concepts in Computer Science | 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers | Dieter Kratsch | Taschenbuch | xiv | Englisch | 2005 | Springer | EAN 9783540310006 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: preigu, Osnabrück, Germania
EUR 50,35
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Graph-Theoretic Concepts in Computer Science | 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers | Dieter Kratsch (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xi | Englisch | 2014 | Springer | EAN 9783319123394 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 109,78
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 100,24
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 130,73
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Buchpark, Trebbin, Germania
EUR 31,96
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Sehr gut. Zustand: Sehr gut | Seiten: 341 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
Da: Buchpark, Trebbin, Germania
EUR 31,96
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Sehr gut. Zustand: Sehr gut | Seiten: 341 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.