- 5 Results
Lowest price: € 37.25, highest price: € 57.71, average price: € 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
Order
at ZVAB.com
€ 57.71
Shipment: € 0.001
Order
Provider details
Sponsored link
Hajo Broersma:

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

2008, ISBN: 3540922474

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

NEW BOOK. Shipping costs:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
close (x)
2
Graph-Theoretic Concepts in Computer Science - Hajo Broersma
Order
at AbeBooks.de
€ 53.49
Shipment: € 0.001
Order
Provider details
Sponsored link

Hajo Broersma:

Graph-Theoretic Concepts in Computer Science - Paperback

2008, ISBN: 3540922474

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

NEW BOOK. Shipping costs:Versandkostenfrei. (EUR 0.00) BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 4 (von 5)]
close (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)
Order
at Achtung-Buecher.de
€ 55.60
Shipment: € 0.001
Order
Provider details
Sponsored link
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 - new book

2008

ISBN: 3540922474

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

Shipping costs:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
close (x)
4
Order
at ZVAB.com
€ 37.25
Shipment: € 0.001
Order
Provider details
Sponsored link
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 - First edition

2008, ISBN: 3540922474

Paperback

[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… More...

NOT NEW BOOK. Shipping costs:Versandkostenfrei. (EUR 0.00) Buchpark, Trebbin, Germany [83435977] [Rating: 5 (von 5)]
close (x)
5
Graph-Theoretic Concepts in Computer Science - Broersma, Hajo|Erlebach, Thomas|Friedetzky, Tom|Paulusma, Daniel
Order
at AbeBooks.de
€ 48.37
Shipment: € 0.001
Order
Provider details
Sponsored link
Broersma, Hajo|Erlebach, Thomas|Friedetzky, Tom|Paulusma, Daniel:
Graph-Theoretic Concepts in Computer Science - Paperback

2008, ISBN: 3540922474

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

NEW BOOK. Shipping costs:Versandkostenfrei. (EUR 0.00) moluna, Greven, Germany [73551232] [Rating: 4 (von 5)]
close (x)
1As some platforms do not transmit shipping conditions to us and these may depend on the country of delivery, the purchase price, the weight and size of the item, a possible membership of the platform, a direct delivery by the platform or via a third-party provider (Marketplace), etc., it is possible that the shipping costs indicated by euro-book.co.uk / euro-book.co.uk do not correspond to those of the offering platform.

Bibliographic data of the best matching book

Details of the book
Graph-Theoretic Concepts in Computer Science
Author:
Title:
ISBN:

3540922474


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.

Details of the book - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540922476
ISBN (ISBN-10): 3540922474
Hardcover
Paperback
Publishing year: 2008
Publisher: Springer Berlin Heidelberg
386 Pages
Weight: 0,597 kg
Language: eng/Englisch

Book in our database since 2008-12-19T16:56:34+00:00 (London)
Detail page last modified on 2024-02-07T05:07:01+00:00 (London)
ISBN/EAN: 3540922474

ISBN - alternate spelling:
3-540-92247-4, 978-3-540-92247-6
Alternate spelling and related search-keywords:
Book author: erlebach, thomas daniel, friedetzky, paulus, broers, broer, thomas erle, friede paul, hajo
Book title: graph theoretic concepts computer science, june, july, before the computer, papers

Information from Publisher

Author: Hajo Broersma; Thomas Erlebach; Tom Friedetzky; Daniel Paulusma
Title: 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
Publisher: Springer; Springer Berlin
386 Pages
Publishing year: 2008-12-18
Berlin; Heidelberg; DE
Language: English
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.
< to archive...