- 5 Ergebnisse
Kleinster Preis: € 42,79, größter Preis: € 107,70, Mittelwert: € 67,34
1
Graph-Theoretic Concepts in Computer Science
Bestellen
bei Orellfuessli.ch
CHF 112,90
(ca. € 107,70)
Versand: € 17,171
Bestellengesponserter Link

Graph-Theoretic Concepts in Computer Science - neues Buch

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

Nr. A1038244037. Versandkosten: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
Bestellen
bei hive.co.uk
£ 38,24
(ca. € 43,94)
Bestellengesponserter Link

Markus Vincze:

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

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

No. 9783540922483. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
3
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - Weiming Shen
Bestellen
bei hive.co.uk
£ 61,20
(ca. € 69,39)
Bestellengesponserter Link
Weiming Shen:
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - neues Buch

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

No. 9783540922483. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
4
Graph-Theoretic Concepts in Computer Science
Bestellen
bei Springer.com
€ 42,79
Versand: € 0,001
Bestellengesponserter Link
Graph-Theoretic Concepts in Computer Science - neues Buch

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

Nr. 978-3-540-92248-3. Versandkosten: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
Bestellen
bei hive.co.uk
£ 61,20
(ca. € 72,88)
Bestellengesponserter Link
Thomas Kirschstein:
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - neues Buch

2008, ISBN: 9783540922483

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

No. 9783540922483. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch

Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540922483
Erscheinungsjahr: 2008
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2015-11-27T15:16:44+01:00 (Berlin)
Detailseite zuletzt geändert am 2024-01-10T22:56:42+01:00 (Berlin)
ISBN/EAN: 9783540922483

ISBN - alternative Schreibweisen:
978-3-540-92248-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: thomas daniel, broers, thomas erle, kirschstein
Titel des Buches: graph theoretic concepts computer science


Daten vom Verlag:

Autor/in: Hajo Broersma; Thomas Erlebach; Tom Friedetzky; Daniel Paulusma
Titel: 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
Verlag: Springer; Springer Berlin
386 Seiten
Erscheinungsjahr: 2008-12-05
Berlin; Heidelberg; DE
Sprache: Englisch
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.

< zum Archiv...