- 5 Résultats
prix le plus bas: € 42,79, prix le plus élevé: € 107,70, prix moyen: € 67,34
1
Graph-Theoretic Concepts in Computer Science
Commander
sur Orellfuessli.ch
CHF 112,90
(environ € 107,70)
Envoi: € 17,171
CommanderLien sponsorisé

Graph-Theoretic Concepts in Computer Science - nouveau livre

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

Nr. A1038244037. Frais d'envoiLieferzeiten 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
Commander
sur hive.co.uk
£ 38,24
(environ € 43,94)
CommanderLien sponsorisé

Markus Vincze:

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

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

No. 9783540922483. Frais d'envoiInstock, Despatched same working day before 3pm, zzgl. Versandkosten., Livraison non-comprise
3
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - Weiming Shen
Commander
sur hive.co.uk
£ 61,20
(environ € 69,39)
CommanderLien sponsorisé
Weiming Shen:
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - nouveau livre

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

No. 9783540922483. Frais d'envoiInstock, Despatched same working day before 3pm, zzgl. Versandkosten., Livraison non-comprise
4
Graph-Theoretic Concepts in Computer Science
Commander
sur Springer.com
€ 42,79
Envoi: € 0,001
CommanderLien sponsorisé
Graph-Theoretic Concepts in Computer Science - nouveau livre

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

Nr. 978-3-540-92248-3. Frais d'envoiWorldwide 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
Commander
sur hive.co.uk
£ 61,20
(environ € 72,88)
CommanderLien sponsorisé
Thomas Kirschstein:
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers - nouveau livre

2008, ISBN: 9783540922483

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

No. 9783540922483. Frais d'envoiInstock, Despatched same working day before 3pm, zzgl. Versandkosten., Livraison non-comprise

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

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


EAN (ISBN-13): 9783540922483
Date de parution: 2008
Editeur: Springer Berlin Heidelberg

Livre dans la base de données depuis 2015-11-27T15:16:44+01:00 (Paris)
Page de détail modifiée en dernier sur 2024-01-10T22:56:42+01:00 (Paris)
ISBN/EAN: 9783540922483

ISBN - Autres types d'écriture:
978-3-540-92248-3
Autres types d'écriture et termes associés:
Auteur du livre: thomas daniel, broers, thomas erle, kirschstein
Titre du livre: graph theoretic concepts computer science


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-05
Berlin; Heidelberg; DE
Langue: Anglais
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.

< pour archiver...