- 5 Ergebnisse
Kleinster Preis: € 4,55, größter Preis: € 93,08, Mittelwert: € 53,09
1
Graph-Theoretic Concepts in Computer Science : 25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings - Peter Widmayer
Bestellen
bei ZVAB.com
€ 53,74
Versand: € 0,001
Bestellengesponserter Link
Peter Widmayer:

Graph-Theoretic Concepts in Computer Science : 25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings - Taschenbuch

1999, ISBN: 3540667318

[EAN: 9783540667315], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], GRAPH - GRAPHENTHEORIE; GRAPH; GRAPHCOMPUTATIONS; MATCHING; MATCHINGS; PARTITION; PERMUTATION; ALGORITHMS; APPR… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
2
Graph-Theoretic Concepts in Computer Science : 25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings - Peter Widmayer
Bestellen
bei ZVAB.com
€ 59,11
Versand: € 0,001
Bestellengesponserter Link

Peter Widmayer:

Graph-Theoretic Concepts in Computer Science : 25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings - Taschenbuch

1999, ISBN: 3540667318

[EAN: 9783540667315], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], GRAPH - GRAPHENTHEORIE; GRAPH; GRAPHCOMPUTATIONS; MATCHING; MATCHINGS; PARTITION; PERMUTATION; ALGORITHMS; APPR… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
3
Graph-Theoretic Concepts in Computer Science - Peter Widmayer
Bestellen
bei booklooker.de
€ 93,08
Versand: € 0,001
Bestellengesponserter Link
Peter Widmayer:
Graph-Theoretic Concepts in Computer Science - Taschenbuch

2027

ISBN: 9783540667315

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - The 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 99) celebrated the anniversaryof the wor… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) BuchWeltWeit Inh. Ludwig Meier e.K.
4
Graph-Theoretic Concepts in Computer Science: 25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings Peter Widmayer Edi
Bestellen
bei BarnesandNoble.com
€ 54,99
Bestellengesponserter Link
Graph-Theoretic Concepts in Computer Science: 25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings Peter Widmayer Edi - neues Buch

ISBN: 9783540667315

This book constitutes the refereed proceedings of the 25th International Workshop on Graph-Theorie Concepts in Computer Science WG'99, held at the Centre Stefano Frascini on Monte Verita,… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
5
Bestellen
bei Biblio.co.uk
$ 4,95
(ca. € 4,55)
Versand: € 20,231
Bestellengesponserter Link
Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz:
Graph-Theoretic Concepts in Computer Science: 25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings (Lecture Notes in Computer Science) - Taschenbuch

1999, ISBN: 9783540667315

Springer, 1999. *Price HAS BEEN REDUCED by 10% until Monday, Dec. 4 (weekend sale item)* 414 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, t… Mehr…

Versandkosten: EUR 20.23 Zubal Books

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Graph-Theoretic Concepts in Computer Science: 25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings Peter Widmayer Edi

This book constitutes the refereed proceedings of the 25th International Workshop on Graph-Theorie Concepts in Computer Science WG'99, held at the Centre Stefano Frascini on Monte Verita, Ascona, Switzerland in June 1999. The 33 revised full papers presented together with four invited contributions were carefully reviewed and selected from 64 papers submitted. The papers provide a wealth of new results for various graph classes, graph computations, graph algorithms and graph-theoretical applications in a variety of fields.

Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science: 25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings Peter Widmayer Edi


EAN (ISBN-13): 9783540667315
ISBN (ISBN-10): 3540667318
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1999
Herausgeber: Springer Berlin Heidelberg Core >1
432 Seiten
Gewicht: 0,649 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-21T09:16:24+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-02-07T06:07:01+01:00 (Zurich)
ISBN/EAN: 9783540667315

ISBN - alternative Schreibweisen:
3-540-66731-8, 978-3-540-66731-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: neyer, eidenbenz, peter gabriel, gabriele, widmayer, neye, peter stephan, ney, goos, young peter, peter spain, held peter, eiden
Titel des Buches: ascona, graph theoretic concepts computer science, who who 1999, switzerland, lecture notes computer science, proceedings international workshop


Daten vom Verlag:

Autor/in: Peter Widmayer; Gabriele Neyer; Stephan Eidenbenz
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings
Verlag: Springer; Springer Berlin
416 Seiten
Erscheinungsjahr: 1999-10-27
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XI, 416 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Graph; Graph computations; Matching; Matchings; Partition; Permutation; algorithms; approximation; combinatorial optimization; complexity; computational geometry; garph drawing; geometry algorithms; graph algorithms; graph coloring; algorithm analysis and problem complexity; combinatorics; data structures; Theory of Computation; Algorithms; Discrete Mathematics; Data Science; Computer Graphics; Algorithmen und Datenstrukturen; Diskrete Mathematik; Datenbanken; Grafikprogrammierung; EA

Silver Graphs: Achievements and New Challenges.- Online Algorithms: A Study of Graph-Theoretic Concepts.- Discrete Optimization Methods for Packing Problems in Two and Three Dimensions — With Applications in the Textile and Car Manufacturing Industries.- Informatica, Scuola, Communità: Uno Sguardo dall’ Occhio del Ciclone.- Proximity-Preserving Labeling Schemes and Their Applications.- Euler Is Standing in Line.- Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2.- Complexity Classification of Some Edge Modification Problems.- On Minimum Diameter Spanning Trees under Reload Costs.- Induced Matchings in Regular Graphs and Trees.- Mod-2 Independence and Domination in Graphs.- NLC2-Decomposition in Polynomial Time.- On the Nature of Structure and Its Identification.- On the Clique—Width of Perfect Graph Classes.- An Improved Algorithm for Finding Tree Decompositions of Small Width.- Efficient Analy sis of Graphs with Small Minimal Separators.- Generating All the Minimal Separators of a Graph.- Two Broadcasting Problems in FaultyHypercubes.- Routing Permutations in the Hypercube.- An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs.- Optimal Irreversible Dy namos in Chordal Rings.- Recognizing Bipartite Incident-Graphs of Circulant Digraphs.- Optimal Cuts for Powers of the Petersen Graph.- Dihamiltonian Decomposition of Regular Graphs with Degree Three.- Box-Rectangular Drawings of Plane Graphs.- A Multi-Scale Algorithm for Drawing Graphs Nicely.- All Separating Triangles in a Plane Graph Can Be Optimally “Broken” in Poly nomial Time.- Linear Orderings of Random Geometric Graphs.- Finding Smallest Supertrees Under Minor Containment.- Vertex Cover: Further Observations and Further Improvements.- On the Hardness ofRecognizing Bundles in Time Table Graphs.- Optimal Solutions for Frequency Assignment Problems via Tree Decomposition.- Fixed-Parameter Complexity of ?-Labelings.- Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)—Free Graphs.- On Claw-Free Asteroidal Triple-Free Graphs.- Vertex Partitioning of Crown-Free Interval Graphs.- Triangulated Neighbourhoods in C 4-Free Berge Graphs.
Includes supplementary material: sn.pub/extras

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9788121550000 The Runaways: A Novel (Fatima Bhutto)


< zum Archiv...