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…
Springer.com new in stock. Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540483823
Computer Science; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Numeric Computing; Data Structures; Computer Graphics; Algorithms Algorithms, Graph,… Mehr…
Springer.com Versandkosten:zzgl. Versandkosten. Details... |
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…
Hugendubel.de No. 25412988. Versandkosten:Zzgl. Versandkosten., zzgl. Versandkosten Details... |
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
hive.co.uk No. 9783540483823. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten. Details... |
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
hive.co.uk No. 9783540483823. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten. Details... |
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…
ISBN: 9783540483823
Computer Science; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Numeric Computing; Data Structures; Computer Graphics; Algorithms Algorithms, Graph,… Mehr…
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…
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
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
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.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9780387194226 Graph-Theoretic Concepts in Computer Science: International Workshop WG'87, Kloster Banz/Staffelstein, FRG, June 29 - July 1, 1987, Proceedings (Lecture Notes In Computer Science 314) (Gottler, H)
- 9780387194226 Graph-Theoretic Concepts in Computer Science: International Workshop WG'87, Kloster Banz/Staffelstein, FRG, June 29 - July 1, 1987, Proceedings (Lecture Notes In Computer Science 314) (Gottler, H)
- 9783540194224 Graph-Theoretic Concepts in Computer Science (Goettler, Herbert Schneider, Hans-Juergen)
- Graph-Theoretic Concepts in Computer Science: International Workshop WG '87, Kloster Banz/Staffelstein, FRG, June 29 - July 1, 1987. Proceedings (Lecture Notes in Computer Science) (2008-06-13) (unknown)
< zum Archiv...