- 5 Résultats
prix le plus bas: € 53,49, prix le plus élevé: € 179,92, prix moyen: € 83,11
1
Graph-Theoretic Concepts in Computer Science
Commander
sur Springer.com
€ 53,49
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé

Graph-Theoretic Concepts in Computer Science - nouveau livre

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 … Plus…

Nr. 978-3-540-00331-1. Frais d'envoiWorldwide free shipping, , DE. (EUR 0.00)
fermer(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)
Commander
sur Achtung-Buecher.de
€ 55,60
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé

Kucera, Ludek (Herausgeber):

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

2002, ISBN: 3540003312

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

Frais d'envoiVersandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
fermer(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
Commander
sur amazon.de
€ 179,92
Envoi: € 3,001
Commander
Détails du fournisseur
Lien sponsorisé
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] - Livres de poche

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… Plus…

Frais d'envoiGewöhnlich versandfertig in 7 bis 8 Tagen. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) s4store
fermer(X)
4
Commander
sur Biblio.co.uk
$ 77,07
(environ € 70,45)
Envoi: € 11,871
Commander
Détails du fournisseur
Lien sponsorisé
Ludek Kucera:
Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers - Livres de poche

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. … Plus…

Frais d'envoi EUR 11.87 The Saint Bookstore
fermer(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
Commander
sur Blackwells.co.uk
£ 48,45
(environ € 56,07)
Envoi: € 8,971
Commander
Détails du fournisseur
Lien sponsorisé
Kucera, Ludek:
Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers - Livres de poche

2002, ISBN: 9783540003311

paperback, [PU: Springer, Berlin/Heidelberg]

in stock. Frais d'envoiUnknown. (EUR 8.97) Blackwells.co.uk
fermer(X)
1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre
[(Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers)] [by: Ludek Kucera]
Auteur:
Titre:
ISBN:

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.

Informations détaillées sur le livre - [(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
Livre de poche
Date de parution: 2002
Editeur: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
440 Pages
Poids: 0,661 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2007-06-02T06:01:41+02:00 (Paris)
Page de détail modifiée en dernier sur 2024-01-17T18:16:07+01:00 (Paris)
ISBN/EAN: 9783540003311

ISBN - Autres types d'écriture:
3-540-00331-2, 978-3-540-00331-1
Autres types d'écriture et termes associés:
Auteur du livre: kucera, ursus wehrli, proust, lippert jakob, kirmeier
Titre du livre: 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

Données de l'éditeur

Auteur: Ludek Kucera
Titre: 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
Editeur: Springer; Springer Berlin
422 Pages
Date de parution: 2002-12-13
Berlin; Heidelberg; DE
Langue: Anglais
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
< pour archiver...