- 5 Ergebnisse
Kleinster Preis: € 40,12, größter Preis: € 105,55, Mittelwert: € 76,92
1
Bestellen
bei CampusRitter.de
€ 40,12 (Miete/M)
Bestellen (Miete/m)gesponserter Link

Graph-Theoretic Concepts in Computer Science (Mieten. Jahres-Abopreis pro Monat)

2006, ISBN: 9783540483816

32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) was held o… Mehr…

Versandkosten:zzgl. Versandkosten; Lieferung nur nach D. Campusritter
2
Graph-Theoretic Concepts in Computer Science: 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Pape
Bestellen
bei Indigo.ca
C$ 154,95
(ca. € 105,55)
Bestellengesponserter Link
Graph-Theoretic Concepts in Computer Science: 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Pape - neues Buch

2006, ISBN: 9783540483816

The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) was held on the island of Sotra close to the city of Bergen on the west coast of Norway. The work… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
3
Graph-Theoretic Concepts in Computer Science - Springer Berlin
Bestellen
bei Orellfuessli.ch
CHF 85,90
(ca. € 78,44)
Versand: € 16,441
Bestellengesponserter Link
Springer Berlin:
Graph-Theoretic Concepts in Computer Science - Taschenbuch

2006

ISBN: 9783540483816

The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) was held on the island of Sotra close to the city of Bergen on the west coast of Norway. The work… Mehr…

Nr. 14106442. Versandkosten:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 6 - 9 Werktagen, zzgl. Versandkosten. (EUR 16.44)
4
Graph-Theoretic Concepts in Computer Science - Fedor V. Fomin
Bestellen
bei lehmanns.de
€ 80,24
Versand: € 0,001
Bestellengesponserter Link
Fedor V. Fomin:
Graph-Theoretic Concepts in Computer Science - Erstausgabe

2006, ISBN: 9783540483816

Taschenbuch

32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers, Buch, Softcover, [PU: Springer Berlin], [ED: 1], Springer Berlin, 2006

Versandkosten:Versand in 10-14 Tagen. (EUR 0.00)
5
Graph-Theoretic Concepts in Computer Science - Fedor V. Fomin
Bestellen
bei lehmanns.de
€ 80,24
Versand: € 0,001
Bestellengesponserter Link
Fedor V. Fomin:
Graph-Theoretic Concepts in Computer Science - Taschenbuch

2006, ISBN: 9783540483816

32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2006

Versandkosten:Versand in 10-14 Tagen. (EUR 0.00)

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

This book constitutes the thoroughly refereed post-proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2006, held in Bergen, Norway in June 2006. The 30 revised full papers presented together with one invited paper were carefully selected from 91 submissions. The papers address all aspects of graph-theoretic concepts in computer science.

Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540483816
ISBN (ISBN-10): 3540483810
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2006
Herausgeber: Springer Berlin
358 Seiten
Gewicht: 0,564 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-29T14:33:40+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-02-07T09:03:41+01:00 (Zurich)
ISBN/EAN: 9783540483816

ISBN - alternative Schreibweisen:
3-540-48381-0, 978-3-540-48381-6
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: fomin
Titel des Buches: graph theoretic concepts computer science, general papers, lecture notes computer science, bergen


Daten vom Verlag:

Autor/in: Fedor V. Fomin
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Graph-Theoretic Concepts in Computer Science - 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers
Verlag: Springer; Springer Berlin
358 Seiten
Erscheinungsjahr: 2006-11-03
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIII, 358 p.

BC; Hardcover, Softcover / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Algorithmen und Datenstrukturen; Verstehen; Algorithms; Graph; Graph theory; Layout; algorithm; 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

Treewidth: Characterizations, Applications, and Computations.- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy.- Generalised Dualities and Finite Maximal Antichains.- Chordal Deletion Is Fixed-Parameter Tractable.- A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators.- Divide-and-Color.- Listing Chordal Graphs and Interval Graphs.- A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs.- Improved Edge-Coloring with Three Colors.- Vertex Coloring of Comparability+ke and –ke Graphs.- Convex Drawings of Graphs with Non-convex Boundary.- How to Sell a Graph: Guidelines for Graph Retailers.- Strip Graphs: Recognition and Scheduling.- Approximating the Traffic Grooming Problem in Tree and Star Networks.- Bounded Arboricity to Determine the Local Structure of Sparse Graphs.- An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time.- Partitioned Probe Comparability Graphs.- Computing Graph Polynomials on Graphs of Bounded Clique-Width.- Generation of Graphs with Bounded Branchwidth.- Minimal Proper Interval Completions.- Monotony Properties of Connected Visible Graph Searching.- Finding Intersection Models of Weakly Chordal Graphs.- A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs.- Clique Graph Recognition Is NP-Complete.- Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms.- Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs.- Graph Labelings Derived from Models in Distributed Computing.- Flexible Matchings.- Simultaneous Graph Embeddings with Fixed Edges.- Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions.- Circular-Perfect Concave-RoundGraphs.

< zum Archiv...