- 5 Resultados
precio mínimo: € 42,79, precio máximo: € 107,70, precio promedio: € 67,34
1
Graph-Theoretic Concepts in Computer Science
Pedir
por Orellfuessli.ch
CHF 112,90
(aprox. € 107,70)
Envío: € 17,171
PedirEnlace patrocinado

Graph-Theoretic Concepts in Computer Science - libro nuevo

2008, ISBN: 9783540922483

The 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008) took place in Van Mildert College at Durham University, UK, 30 June - 2 July 2008. The approximat… Más…

Nr. A1038244037. Gastos de envío:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Sofort per Download lieferbar, zzgl. Versandkosten. (EUR 17.17)
2
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - Markus Vincze
Pedir
por hive.co.uk
£ 38,24
(aprox. € 43,94)
PedirEnlace patrocinado

Markus Vincze:

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

2008, ISBN: 9783540922483

The 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008) took place in Van Mildert College at Durham University, UK, 30 June - 2 July 2008.The approximate… Más…

No. 9783540922483. Gastos de envío:Instock, Despatched same working day before 3pm, zzgl. Versandkosten., más gastos de envío
3
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - Weiming Shen
Pedir
por hive.co.uk
£ 61,20
(aprox. € 69,39)
PedirEnlace patrocinado
Weiming Shen:
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - libro nuevo

2008

ISBN: 9783540922483

The 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008) took place in Van Mildert College at Durham University, UK, 30 June - 2 July 2008.The approximate… Más…

No. 9783540922483. Gastos de envío:Instock, Despatched same working day before 3pm, zzgl. Versandkosten., más gastos de envío
4
Graph-Theoretic Concepts in Computer Science
Pedir
por Springer.com
€ 42,79
Envío: € 0,001
PedirEnlace patrocinado
Graph-Theoretic Concepts in Computer Science - libro nuevo

2008, ISBN: 9783540922483

The 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008) took place in Van Mildert College at Durham University, UK, 30 June – 2 July 2008. The approximat… Más…

Nr. 978-3-540-92248-3. Gastos de envío:Worldwide free shipping, , zzgl. Versandkosten. (EUR 0.00)
5
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - Thomas Kirschstein
Pedir
por hive.co.uk
£ 61,20
(aprox. € 72,88)
PedirEnlace patrocinado
Thomas Kirschstein:
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - libro nuevo

2008, ISBN: 9783540922483

; PDF; Scientific, Technical and Medical > Mathematics > Calculus & mathematical analysis > Numerical analy, Springer Fachmedien Wiesbaden

No. 9783540922483. Gastos de envío:Instock, Despatched same working day before 3pm, zzgl. Versandkosten., más gastos de envío

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

Detalles del libro - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540922483
Año de publicación: 2008
Editorial: Springer Berlin Heidelberg

Libro en la base de datos desde 2015-11-27T08:16:44-06:00 (Mexico City)
Página de detalles modificada por última vez el 2024-01-10T15:56:42-06:00 (Mexico City)
ISBN/EAN: 9783540922483

ISBN - escritura alterna:
978-3-540-92248-3
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: thomas daniel, broers, thomas erle, kirschstein
Título del libro: graph theoretic concepts computer science


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-05
Berlin; Heidelberg; DE
Idioma: Inglés
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIII, 386 p.

EA; E107; eBook; Nonbooks, PBS / 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; C; Algorithms; Discrete Mathematics in Computer Science; Numerical Analysis; Data Science; Computer Graphics; Computer Science; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; Datenbanken; Grafikprogrammierung; BC

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