- 5 Risultati
prezzo più basso: € 42,79, prezzo più alto: € 107,70, prezzo medio: € 67,34
1
Graph-Theoretic Concepts in Computer Science
Ordina
da Orellfuessli.ch
CHF 112,90
(indicativi € 107,70)
Spedizione: € 17,171
OrdinaLink sponsorizzato

Graph-Theoretic Concepts in Computer Science - nuovo libro

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

Nr. A1038244037. Costi di spedizione: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
Ordina
da hive.co.uk
£ 38,24
(indicativi € 43,94)
OrdinaLink sponsorizzato

Markus Vincze:

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

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

No. 9783540922483. Costi di spedizione:Instock, Despatched same working day before 3pm, zzgl. Versandkosten., Costi di spedizione aggiuntivi
3
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - Weiming Shen
Ordina
da hive.co.uk
£ 61,20
(indicativi € 69,39)
OrdinaLink sponsorizzato
Weiming Shen:
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - nuovo libro

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

No. 9783540922483. Costi di spedizione:Instock, Despatched same working day before 3pm, zzgl. Versandkosten., Costi di spedizione aggiuntivi
4
Graph-Theoretic Concepts in Computer Science
Ordina
da Springer.com
€ 42,79
Spedizione: € 0,001
OrdinaLink sponsorizzato
Graph-Theoretic Concepts in Computer Science - nuovo libro

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

Nr. 978-3-540-92248-3. Costi di spedizione: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
Ordina
da hive.co.uk
£ 61,20
(indicativi € 72,88)
OrdinaLink sponsorizzato
Thomas Kirschstein:
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - nuovo libro

2008, ISBN: 9783540922483

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

No. 9783540922483. Costi di spedizione:Instock, Despatched same working day before 3pm, zzgl. Versandkosten., Costi di spedizione aggiuntivi

1Poiché alcune piattaforme non trasmettono le condizioni di spedizione e queste possono dipendere dal paese di consegna, dal prezzo di acquisto, dal peso e dalle dimensioni dell'articolo, dall'eventuale iscrizione alla piattaforma, dalla consegna diretta da parte della piattaforma o tramite un fornitore terzo (Marketplace), ecc. è possibile che le spese di spedizione indicate da eurolibro non corrispondano a quelle della piattaforma offerente.

Dati bibliografici del miglior libro corrispondente

Dettagli del libro

Informazioni dettagliate del libro - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540922483
Anno di pubblicazione: 2008
Editore: Springer Berlin Heidelberg

Libro nella banca dati dal 2015-11-27T15:16:44+01:00 (Rome)
Pagina di dettaglio ultima modifica in 2024-01-10T22:56:42+01:00 (Rome)
ISBN/EAN: 9783540922483

ISBN - Stili di scrittura alternativi:
978-3-540-92248-3
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : thomas daniel, broers, thomas erle, kirschstein
Titolo del libro: graph theoretic concepts computer science


Dati dell'editore

Autore: Hajo Broersma; Thomas Erlebach; Tom Friedetzky; Daniel Paulusma
Titolo: 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
Editore: Springer; Springer Berlin
386 Pagine
Anno di pubblicazione: 2008-12-05
Berlin; Heidelberg; DE
Lingua: Inglese
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.

< Per archiviare...