- 5 Ergebnisse
Kleinster Preis: € 53,49, größter Preis: € 179,92, Mittelwert: € 83,11
1
Graph-Theoretic Concepts in Computer Science
Bestellen
bei Springer.com
€ 53,49
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link

Graph-Theoretic Concepts in Computer Science - neues Buch

2002, ISBN: 9783540003311

The 28th International Workshop on Graph-Theoretic Concepts in Computer ? Science (WG 2002) was held in Cesky ´ Krumlov, a beautiful small town in the southern part of the Czech Republic … Mehr…

Nr. 978-3-540-00331-1. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
zuklappen (X)
2
Graph-Theoretic Concepts in Computer Science 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers - Kucera, Ludek (Herausgeber)
Bestellen
bei Achtung-Buecher.de
€ 55,60
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link

Kucera, Ludek (Herausgeber):

Graph-Theoretic Concepts in Computer Science 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers - neues Buch

2002, ISBN: 3540003312

2002 Kartoniert / Broschiert Graph - Graphentheorie, Diskrete Mathematik, Algorithmen und Datenstrukturen, Datenbanken, Theoretische Informatik, Mathematik für Informatiker, Computermod… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
zuklappen (X)
3
[(Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers)] [by: Ludek Kucera] - Ludek Kucera
Bestellen
bei amazon.de
€ 179,92
Versand: € 3,001
Bestellen
Details beim Anbieter
gesponserter Link
Ludek Kucera:
[(Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers)] [by: Ludek Kucera] - Taschenbuch

2003

ISBN: 9783540003311

Springer-Verlag Berlin and Heidelberg GmbH & Co. K, Taschenbuch, Publiziert: 2003-02-12T00:00:00.000+01:00, Produktgruppe: Buch, Kategorien, Bücher, Taschenbücher, acc906d0-2585-4921-a56f… Mehr…

Versandkosten:Gewöhnlich versandfertig in 7 bis 8 Tagen. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) s4store
zuklappen (X)
4
Bestellen
bei Biblio.co.uk
$ 77,07
(ca. € 70,45)
Versand: € 11,871
Bestellen
Details beim Anbieter
gesponserter Link
Ludek Kucera:
Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers - Taschenbuch

2002, ISBN: 9783540003311

Paperback / softback. New. Compiled from the proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, this volume contains 36 revised full papers. … Mehr…

Versandkosten: EUR 11.87 The Saint Bookstore
zuklappen (X)
5
Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers - Kucera, Ludek
Bestellen
bei Blackwells.co.uk
£ 48,45
(ca. € 56,07)
Versand: € 8,971
Bestellen
Details beim Anbieter
gesponserter Link
Kucera, Ludek:
Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers - Taschenbuch

2002, ISBN: 9783540003311

paperback, [PU: Springer, Berlin/Heidelberg]

in stock. Versandkosten:Unknown. (EUR 8.97) Blackwells.co.uk
zuklappen (X)
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: 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers)] [by: Ludek Kucera]
Autor:
Titel:
ISBN-Nummer:

9783540003311


This book constitutes the refereed proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2002, held in Cesky Krumlov, Czech Republic in June 2002.The 36 revised full papers presented were carefully selected from initially 61 submissions during two rounds of reviewing and improvement. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms, and graph-theoretical applications in various fields.

Detailangaben zum Buch - [(Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers)] [by: Ludek Kucera]


EAN (ISBN-13): 9783540003311
ISBN (ISBN-10): 3540003312
Taschenbuch
Erscheinungsjahr: 2002
Herausgeber: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
440 Seiten
Gewicht: 0,661 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-06-02T06:01:41+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-01-17T18:16:07+01:00 (Zurich)
ISBN/EAN: 9783540003311

ISBN - alternative Schreibweisen:
3-540-00331-2, 978-3-540-00331-1
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: kucera, ursus wehrli, proust, lippert jakob, kirmeier
Titel des Buches: cesky krumlov, czech republic, graph theoretic concepts computer science, sergio camargo mira schendel willys castro, auf der suche nach der verlornen zeit, auf der suche nach der verlorenen zeit, kaiser heinrich, oskar niedermayer, june, papers, lecture notes computer science

Daten vom Verlag:

Autor/in: Ludek Kucera
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers
Verlag: Springer; Springer Berlin
422 Seiten
Erscheinungsjahr: 2002-12-13
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XI, 422 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithmic Graph Theory; Approximation; Computational Discrete Mathematics; Computational Geometry; Geometric Algorithms; Graph; Graph Algorithms; Graph Coloring; Graph Computations; Graph Drawing; Network Algorithms; algorithms; computer; computer science; algorithm analysis and problem complexity; data structures; Theory of Computation; Computer Modelling; Algorithms; Data Science; Numerical Analysis; Discrete Mathematics in Computer Science; Computermodellierung und -simulation; Algorithmen und Datenstrukturen; Datenbanken; Numerische Mathematik; Mathematik für Informatiker; Diskrete Mathematik; EA

Maximum Cardinality Search for Computing Minimal Triangulations.- DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem.- On the Minimum Size of a Contraction-Universal Tree.- Optimal Area Algorithm for Planar Polyline Drawings.- Cycles in Generalized Networks.- New Graph Classes of Bounded Clique-Width.- More about Subcolorings.- Search in Indecomposable Graphs.- On the Complexity of (k, l)-Graph Sandwich Problems.- Algorithms and Models for the On-Line Vertex-Covering.- Weighted Node Coloring: When Stable Sets Are Expensive.- The Complexity of Restrictive H-Coloring.- A New 3-Color Criterion for Planar Graphs.- An Additive Stretched Routing Scheme for Chordal Graphs.- Complexity of Pattern Coloring of Cycle Systems.- Safe Reduction Rules for Weighted Treewidth.- Graph Separator Algorithms: A Refined Analysis.- Generalized H-Coloring and H-Covering of Trees.- The Complexity of Approximating the Oriented Diameter of Chordal Graphs.- Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies.- Completely Independent Spanning Trees in Maximal Planar Graphs.- Facets of the Directed Acyclic Graph Layering Polytope.- Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP.- Complexity of Some Infinite Games Played on Finite Graphs.- New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs.- A Multi-scale Algorithm for the Linear Arrangement Problem.- On the b-Chromatic Number of Graphs.- Budgeted Maximum Graph Coverage.- Online Call Admission in Optical Networks with Larger Demands.- The Forest Wrapping Problem on Outerplanar Graphs.- On the Recognition of P 4 -Comparability Graphs.- Bend-Minimum Orthogonal Drawings of Plane 3-Graphs.- Cluster Graph Modification Problems.- Two Counterexamples in Graph Drawing.- Connected and Loosely Connected List Homomorphisms.- Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.
Includes supplementary material: sn.pub/extras
< zum Archiv...