- 5 Ergebnisse
Kleinster Preis: € 80,24, größter Preis: € 96,49, Mittelwert: € 89,70
1
Graph-Theoretic Concepts in Computer Science - Juraj Hromkovič; Manfred Nagl; Bernhard Westfechtel
Bestellen
bei Springer.com
€ 80,24
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Juraj Hromkovič; Manfred Nagl; Bernhard Westfechtel:

Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540305590

During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop a… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00)
zuklappen (X)
2
Graph-Theoretic Concepts in Computer Science - Springer
Bestellen
bei Thalia.de
€ 96,29
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link

Springer:

Graph-Theoretic Concepts in Computer Science - neues Buch

2005, ISBN: 9783540305590

During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop a… Mehr…

Nr. 44259072. Versandkosten:, Sofort per Download lieferbar, DE. (EUR 0.00)
zuklappen (X)
3
Graph-Theoretic Concepts in Computer Science
Bestellen
bei Hugendubel.de
€ 96,49
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Graph-Theoretic Concepts in Computer Science - neues Buch

2004

ISBN: 9783540305590

Graph-Theoretic Concepts in Computer Science ab 96.49 € als pdf eBook: 30th International Workshop WG 2004 Bad Honnef Germany June 21-23 2004 Revised Papers. Aus dem Bereich: eBooks, Sach… Mehr…

Nr. 25411971. Versandkosten:, , DE. (EUR 0.00)
zuklappen (X)
4
Graph-Theoretic Concepts in Computer Science : 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers - David R. Finkelstein
Bestellen
bei hive.co.uk
£ 72,68
(ca. € 80,84)
Bestellen
Details und Versand
gesponserter Link
David R. Finkelstein:
Graph-Theoretic Concepts in Computer Science : 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers - neues Buch

2004, ISBN: 9783540305590

; PDF; Computing > Graphical & digital media applications > 3D graphics & modelling, Springer Berlin Heidelberg

No. 9783540305590. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
zuklappen (X)
5
Bestellen
bei lehmanns.de
€ 94,66
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Juraj Hromkovic; Manfred Nagl; Bernhard Westfechtel:
Graph-Theoretic Concepts in Computer Science - neues Buch

2005, ISBN: 9783540305590

30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, eBooks, eBook Download (PDF), [PU: Springer Berlin Heidelberg], Springer Berlin Heidelberg, 2005

Versandkosten:Download sofort lieferbar. (EUR 0.00)
zuklappen (X)
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
Graph-Theoretic Concepts in Computer Science
Autor:
Titel:
ISBN-Nummer:

9783540305590

Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540305590
Erscheinungsjahr: 2004
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2016-09-01T01:25:36+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-11-28T18:14:23+01:00 (Zurich)
ISBN/EAN: 9783540305590

ISBN - alternative Schreibweisen:
978-3-540-30559-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: nagl, juraj hromkovic, david finkelstein
Titel des Buches: graph theoretic concepts computer science, bad honnef

Daten vom Verlag:

Autor/in: Juraj Hromkovič; Manfred Nagl; Bernhard Westfechtel
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers
Verlag: Springer; Springer Berlin
404 Seiten
Erscheinungsjahr: 2005-01-25
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XI, 404 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Graph; algorithms; bioinformatics; combinatorics; complexity; computer; computer science; optimization; algorithm analysis and problem complexity; data structures; C; Theory of Computation; Simulation and Modeling; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Numeric Computing; Data Structures; Theory of Computation; Computer Modelling; Algorithms; Discrete Mathematics in Computer Science; Numerical Analysis; Data Science; Computer Science; Computermodellierung und -simulation; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; Datenbanken; BC

Invited Papers.- Lexicographic Breadth First Search – A Survey.- Wireless Networking: Graph Theory Unplugged.- Graph Algorithms: Trees.- Constant Time Generation of Trees with Specified Diameter.- Treelike Comparability Graphs: Characterization, Recognition, and Applications.- Elegant Distance Constrained Labelings of Trees.- Collective Tree Spanners and Routing in AT-free Related Graphs.- Graph Algorithms: Recognition and Decomposition.- On the Maximum Cardinality Search Lower Bound for Treewidth.- Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs.- Recognizing HHD-free and Welsh-Powell Opposition Graphs.- Bimodular Decomposition of Bipartite Graphs.- Coloring a Graph Using Split Decomposition.- Graph Algorithms: Various Problems.- Decremental Clique Problem.- A Symbolic Approach to the All-Pairs Shortest-Paths Problem.- Minimal de Bruijn Sequence in a Language with Forbidden Substrings.- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic .- Optimization and Approximation Algorithms.- The Computational Complexity of the Minimum Weight Processor Assignment Problem.- A Stochastic Location Problem with Applications to Tele-diagnostic.- A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs.- Tolerance Based Algorithms for the ATSP.- Parameterized Complexity and Exponential Algorithms.- Finding k Disjoint Triangles in an Arbitrary Graph.- Exact (Exponential) Algorithms for the Dominating Set Problem.- Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps.- Counting, Combinatorics, and Optimization.- Planar Graphs, via Well-Orderly Maps and Trees.- Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs.- Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters.- Applications (Biology, Graph Drawing).- Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs.- Octagonal Drawings of Plane Graphs with Prescribed Face Areas.- Crossing Reduction in Circular Layouts.- Graph Classes and NP Hardness.- Characterization and Recognition of Generalized Clique-Helly Graphs.- Edge-Connectivity Augmentation and Network Matrices.- Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.- The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small.- Core Stability of Minimum Coloring Games.
< zum Archiv...