- 5 Ergebnisse
Kleinster Preis: € 63,06, größter Preis: € 67,99, Mittelwert: € 65,19
1
Graph-Theoretic Concepts in Computer Science - Fedor V. Fomin
Bestellen
bei Springer.com
€ 63,06
Bestellengesponserter Link
Fedor V. Fomin:

Graph-Theoretic Concepts in Computer Science - neues Buch

2006, ISBN: 9783540483823

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.
2
Graph-Theoretic Concepts in Computer Science - Fedor V. Fomin
Bestellen
bei Springer.com
€ 63,06
Bestellengesponserter Link

Fedor V. Fomin:

Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540483823

Computer Science; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Numeric Computing; Data Structures; Computer Graphics; Algorithms Algorithms, Graph,… Mehr…

  - Versandkosten:zzgl. Versandkosten.
3
Graph-Theoretic Concepts in Computer Science als eBook Download von
Bestellen
bei Hugendubel.de
€ 67,99
Bestellengesponserter Link
Graph-Theoretic Concepts in Computer Science als eBook Download von - neues Buch

ISBN: 9783540483823

Lieferung innerhalb 1-4 Werktagen. Versandkostenfrei, wenn Buch oder Hörbuch enthalten ist, sonst 2,95 EUR. Ab 19,90 EUR versandkostenfrei. (Deutschland) eBooks > Sachthemen & Ratgeber … Mehr…

  - No. 25412988. Versandkosten:Zzgl. Versandkosten., zzgl. Versandkosten
4
Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers - Cecilia Di Chio
Bestellen
bei hive.co.uk
£ 57,79
(ca. € 66,05)
Bestellengesponserter Link
Cecilia Di Chio:
Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers - neues Buch

2006, ISBN: 9783540483823

; PDF \ Cecilia Di Chio; Scientific, Technical and Medical > Mathematics > Combinatorics & graph theory, Springer Berlin Heidelberg

  - No. 9783540483823. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
5
Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers - Viviana Colombari
Bestellen
bei hive.co.uk
£ 57,79
(ca. € 65,77)
Bestellengesponserter Link
Viviana Colombari:
Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers - neues Buch

2006, ISBN: 9783540483823

; PDF; Scientific, Technical and Medical > Mathematics > Combinatorics & graph theory, Springer Berlin Heidelberg

  - No. 9783540483823. 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): 9783540483823
Erscheinungsjahr: 2006
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-04-17T03:33:17+02:00 (Zurich)
Detailseite zuletzt geändert am 2021-09-28T13:32:20+02:00 (Zurich)
ISBN/EAN: 9783540483823

ISBN - alternative Schreibweisen:
978-3-540-48382-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: graph theoretic concepts computer science, one norway, kam aus den bergen


Daten vom Verlag:

Autor/in: Fedor V. Fomin
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; 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-10-19
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIII, 358 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Algorithmen und Datenstrukturen; Verstehen; Algorithms; Graph; Graph theory; Layout; algorithm; complexity; computer; computer science; modeling; algorithm analysis and problem complexity; data structures; C; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Numeric Computing; Data Structures; Computer Graphics; Algorithms; 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

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-Round Graphs.

< zum Archiv...