- 5 Résultats
prix le plus bas: € 37,25, prix le plus élevé: € 57,71, prix moyen: € 50,48
1
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - Hajo Broersma
Commander
sur ZVAB.com
€ 57,71
Envoi: € 0,001
CommanderLien sponsorisé
Hajo Broersma:

Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - Livres de poche

2008, ISBN: 3540922474

[EAN: 9783540922476], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], GRAPH - GRAPHENTHEORIE; GRAPH; GRAPHTHEORY; ALGORITHMS; COMPLEXITY; COMPUTERSCIENCE; MODELING; ALGORITHMANALYSI… Plus…

NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
2
Graph-Theoretic Concepts in Computer Science - Hajo Broersma
Commander
sur AbeBooks.de
€ 53,49
Envoi: € 0,001
CommanderLien sponsorisé

Hajo Broersma:

Graph-Theoretic Concepts in Computer Science - Livres de poche

2008, ISBN: 3540922474

[EAN: 9783540922476], Neubuch, [PU: Springer Berlin Heidelberg Dez 2008], GRAPH - GRAPHENTHEORIE; GRAPH; GRAPHTHEORY; ALGORITHMS; COMPLEXITY; COMPUTERSCIENCE; MODELING; ALGORITHMANALYSISA… Plus…

NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00) BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 4 (von 5)]
3
Graph-Theoretic Concepts in Computer Science 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - Broersma, Hajo (Herausgeber); Paulusma, Daniel (Herausgeber); Friedetzky, Tom (Herausgeber); Erlebach, Thomas (Herausgeber)
Commander
sur Achtung-Buecher.de
€ 55,60
Envoi: € 0,001
CommanderLien sponsorisé
Broersma, Hajo (Herausgeber); Paulusma, Daniel (Herausgeber); Friedetzky, Tom (Herausgeber); Erlebach, Thomas (Herausgeber):
Graph-Theoretic Concepts in Computer Science 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - nouveau livre

2008

ISBN: 3540922474

2008 Kartoniert / Broschiert Graph - Graphentheorie, Diskrete Mathematik, Algorithmen und Datenstrukturen, Grafikprogrammierung, Datenbanken, Mathematik für Informatiker, Graph; graphth… Plus…

Frais d'envoiVersandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
4
Commander
sur ZVAB.com
€ 37,25
Envoi: € 0,001
CommanderLien sponsorisé
Broersma, Hajo, Thomas Erlebach und Tom Friedetzky:
Graph-Theoretic Concepts in Computer Science 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - Première édition

2008, ISBN: 3540922474

Livres de poche

[EAN: 9783540922476], Gebraucht, guter Zustand, [SC: 0.0], [PU: Springer Berlin], ALGORITHM ANALYSIS AND PROBLEM COMPLEXITY,DATA STRUCTURES,GRAPH,COMPUTER SCIENCE,GRAPH THEORY,MODELING,AL… Plus…

NOT NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00) Buchpark, Trebbin, Germany [83435977] [Rating: 5 (von 5)]
5
Graph-Theoretic Concepts in Computer Science - Broersma, Hajo|Erlebach, Thomas|Friedetzky, Tom|Paulusma, Daniel
Commander
sur AbeBooks.de
€ 48,37
Envoi: € 0,001
CommanderLien sponsorisé
Broersma, Hajo|Erlebach, Thomas|Friedetzky, Tom|Paulusma, Daniel:
Graph-Theoretic Concepts in Computer Science - Livres de poche

2008, ISBN: 3540922474

[EAN: 9783540922476], Neubuch, [PU: Springer Berlin Heidelberg], GRAPH - GRAPHENTHEORIE GRAPHTHEORY ALGORITHMS COMPLEXITY COMPUTERSCIENCE MODELING ALGORITHMANALYSISANDPROBLEMCOMPLEXITY DA… Plus…

NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00) moluna, Greven, Germany [73551232] [Rating: 4 (von 5)]

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

This book constitutes the thoroughly refereed post-conference proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008, held in Durham, UK, in June/July 2008. The 30 revised full papers presented together with 3 invited paper were carefully reviewed and selected from 76 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations.

Informations détaillées sur le livre - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540922476
ISBN (ISBN-10): 3540922474
Version reliée
Livre de poche
Date de parution: 2008
Editeur: Springer Berlin Heidelberg
386 Pages
Poids: 0,597 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2008-12-19T17:56:34+01:00 (Paris)
Page de détail modifiée en dernier sur 2024-02-07T06:07:01+01:00 (Paris)
ISBN/EAN: 9783540922476

ISBN - Autres types d'écriture:
3-540-92247-4, 978-3-540-92247-6
Autres types d'écriture et termes associés:
Auteur du livre: erlebach, thomas daniel, friedetzky, paulus, broers, broer, thomas erle, friede paul, hajo
Titre du livre: graph theoretic concepts computer science, june, july, before the computer, papers


Données de l'éditeur

Auteur: Hajo Broersma; Thomas Erlebach; Tom Friedetzky; Daniel Paulusma
Titre: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Graph-Theoretic Concepts in Computer Science - 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers
Editeur: Springer; Springer Berlin
386 Pages
Date de parution: 2008-12-18
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIII, 386 p.

BC; Hardcover, Softcover / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Algorithmen und Datenstrukturen; Verstehen; Graph; Graph theory; algorithms; complexity; computer; computer science; modeling; algorithm analysis and problem complexity; data structures; Algorithms; Discrete Mathematics in Computer Science; Numerical Analysis; Data Science; Computer Graphics; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; Datenbanken; Grafikprogrammierung; EA

Invited Contributions.- (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective.- Memory Efficient Anonymous Graph Exploration.- Algorithmic Meta Theorems.- Regular Papers.- A Most General Edge Elimination Polynomial.- Approximating the Metric TSP in Linear Time.- The Valve Location Problem in Simple Network Topologies.- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.- On the Pseudo-achromatic Number Problem.- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings.- Faster Exact Bandwidth.- Additive Spanners for Circle Graphs and Polygonal Graphs.- Upward Straight-Line Embeddings of Directed Graphs into Point Sets.- Complexity of the Packing Coloring Problem for Trees.- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges.- A Lower Bound on the Area Requirements of Series-Parallel Graphs.- On Independent Sets and Bicliques in Graphs.- Evaluations of Graph Polynomials.- Parameterized Complexity for Domination Problems on Degenerate Graphs.- An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph.- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.- The Rank-Width of the Square Grid.- Improved Upper Bounds for Partial Vertex Cover.- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width.- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms.- What Is between Chordal and Weakly Chordal Graphs?.- Parameterized Graph Cleaning Problems.- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph.- Fast Robber in Planar Graphs.- From a Circular-Arc Model to a Proper Circular-Arc Model.- DigraphDecompositions and Monotonicity in Digraph Searching.- Searching for a Visible, Lazy Fugitive.- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes.- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs.

< pour archiver...