- 5 Resultados
precio mínimo: € 37,25, precio máximo: € 57,71, precio promedio: € 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
Pedir
por ZVAB.com
€ 57,71
Envío: € 0,001
Pedir
Detalles del proveedor
Enlace patrocinado
Hajo Broersma:

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

2008, ISBN: 3540922474

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

NEW BOOK. Gastos de envío:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
cerrar (X)
2
Graph-Theoretic Concepts in Computer Science - Hajo Broersma
Pedir
por AbeBooks.de
€ 53,49
Envío: € 0,001
Pedir
Detalles del proveedor
Enlace patrocinado

Hajo Broersma:

Graph-Theoretic Concepts in Computer Science - Pasta blanda

2008, ISBN: 3540922474

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

NEW BOOK. Gastos de envío:Versandkostenfrei. (EUR 0.00) BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 4 (von 5)]
cerrar (X)
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)
Pedir
por Achtung-Buecher.de
€ 55,60
Envío: € 0,001
Pedir
Detalles del proveedor
Enlace patrocinado
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 - libro nuevo

2008

ISBN: 3540922474

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

Gastos de envío:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
cerrar (X)
4
Pedir
por ZVAB.com
€ 37,25
Envío: € 0,001
Pedir
Detalles del proveedor
Enlace patrocinado
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 - Primera edición

2008, ISBN: 3540922474

Pasta blanda

[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… Más…

NOT NEW BOOK. Gastos de envío:Versandkostenfrei. (EUR 0.00) Buchpark, Trebbin, Germany [83435977] [Rating: 5 (von 5)]
cerrar (X)
5
Graph-Theoretic Concepts in Computer Science - Broersma, Hajo|Erlebach, Thomas|Friedetzky, Tom|Paulusma, Daniel
Pedir
por AbeBooks.de
€ 48,37
Envío: € 0,001
Pedir
Detalles del proveedor
Enlace patrocinado
Broersma, Hajo|Erlebach, Thomas|Friedetzky, Tom|Paulusma, Daniel:
Graph-Theoretic Concepts in Computer Science - Pasta blanda

2008, ISBN: 3540922474

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

NEW BOOK. Gastos de envío:Versandkostenfrei. (EUR 0.00) moluna, Greven, Germany [73551232] [Rating: 4 (von 5)]
cerrar (X)
1Dado que algunas plataformas no nos comunican las condiciones de envío y éstas pueden depender del país de entrega, del precio de compra, del peso y tamaño del artículo, de una posible membresía a la plataforma, de una entrega directa por parte de la plataforma o a través de un tercero (Marketplace), etc., es posible que los gastos de envío indicados por eurolibro/terralibro no concuerden con los de la plataforma ofertante.

Datos bibliográficos del mejor libro coincidente

Detalles del libro
Graph-Theoretic Concepts in Computer Science
Autor:
Título:
ISBN:

9783540922476


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.

Detalles del libro - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540922476
ISBN (ISBN-10): 3540922474
Tapa dura
Tapa blanda
Año de publicación: 2008
Editorial: Springer Berlin Heidelberg
386 Páginas
Peso: 0,597 kg
Idioma: eng/Englisch

Libro en la base de datos desde 2008-12-19T17:56:34+01:00 (Madrid)
Página de detalles modificada por última vez el 2024-02-07T06:07:01+01:00 (Madrid)
ISBN/EAN: 9783540922476

ISBN - escritura alterna:
3-540-92247-4, 978-3-540-92247-6
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: erlebach, thomas daniel, friedetzky, paulus, broers, broer, thomas erle, friede paul, hajo
Título del libro: graph theoretic concepts computer science, june, july, before the computer, papers

Datos del la editorial

Autor: Hajo Broersma; Thomas Erlebach; Tom Friedetzky; Daniel Paulusma
Título: 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
Editorial: Springer; Springer Berlin
386 Páginas
Año de publicación: 2008-12-18
Berlin; Heidelberg; DE
Idioma: Inglés
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.
< para archivar...