2010, ISBN: 9783642114083
[ED: Softcover], [PU: Springer / Springer Berlin Heidelberg / Springer, Berlin], The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Mo… Mehr…
booklooker.de buecher.de GmbH & Co. KG Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Details... |
2010, ISBN: 3642114083
The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24-26 2009. About 80 computer scientists from all over t… Mehr…
Weltbild.de Nr. 22489113. Versandkosten:, 2-5 Werktage, zzgl. Versandkosten. (EUR 14.95) Details... |
Graph-Theoretic Concepts in Computer Science | 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers | Christophe Paul (u. a.) | Taschenbuch | XIII | Englisch - Taschenbuch
2010, ISBN: 9783642114083
[ED: Taschenbuch], [PU: Springer], The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24-26 2009. About 80 … Mehr…
booklooker.de |
Graph-Theoretic Concepts in Computer Science / 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers / Christophe Paul (u. a.) / Taschenbuch / XIII / Englisch - Taschenbuch
2010, ISBN: 9783642114083
[ED: Taschenbuch], [PU: Springer], The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24-26 2009. About 80 … Mehr…
booklooker.de |
2010, ISBN: 9783642114083
*Graph-Theoretic Concepts in Computer Science* - 35th International Workshop WG 2009 Montpellier France June 24-26 2009 Revised Papers. Auflage 2010 / Taschenbuch für 53.49 € / Aus dem Be… Mehr…
Hugendubel.de Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00) Details... |
2010, ISBN: 9783642114083
[ED: Softcover], [PU: Springer / Springer Berlin Heidelberg / Springer, Berlin], The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Mo… Mehr…
Daniel Meister, David Peleg, Ignasi Sau, Takeaki Uno, Michal Stern, Henning Fernau:
Graph-Theoretic Concepts in Computer Science - neues Buch2010, ISBN: 3642114083
The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24-26 2009. About 80 computer scientists from all over t… Mehr…
Graph-Theoretic Concepts in Computer Science | 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers | Christophe Paul (u. a.) | Taschenbuch | XIII | Englisch - Taschenbuch
2010
ISBN: 9783642114083
[ED: Taschenbuch], [PU: Springer], The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24-26 2009. About 80 … Mehr…
Graph-Theoretic Concepts in Computer Science / 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers / Christophe Paul (u. a.) / Taschenbuch / XIII / Englisch - Taschenbuch
2010, ISBN: 9783642114083
[ED: Taschenbuch], [PU: Springer], The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24-26 2009. About 80 … Mehr…
2010, ISBN: 9783642114083
*Graph-Theoretic Concepts in Computer Science* - 35th International Workshop WG 2009 Montpellier France June 24-26 2009 Revised Papers. Auflage 2010 / Taschenbuch für 53.49 € / Aus dem Be… Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science
EAN (ISBN-13): 9783642114083
ISBN (ISBN-10): 3642114083
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: Springer Berlin
352 Seiten
Gewicht: 0,557 kg
Sprache: eng/Englisch
Buch in der Datenbank seit 2008-11-27T11:38:30+01:00 (Zurich)
Detailseite zuletzt geändert am 2024-02-15T03:13:36+01:00 (Zurich)
ISBN/EAN: 9783642114083
ISBN - alternative Schreibweisen:
3-642-11408-3, 978-3-642-11408-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: david stern, fernau, daniel stern, meister paul, michel paul, uno, christophe, sau, habib, chris paul, paul christ, christoph michel, michel christop, paul häb
Titel des Buches: montpellier, france, meister, graph theoretic concepts computer science, david stern, 2009
Daten vom Verlag:
Autor/in: Christophe Paul; Michel Habib
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers
Verlag: Springer; Springer Berlin
353 Seiten
Erscheinungsjahr: 2010-01-11
Berlin; Heidelberg; DE
Gewicht: 0,563 kg
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
XIII, 353 p.
BC; Discrete Mathematics in Computer Science; Hardcover, Softcover / Informatik, EDV/Informatik; Mathematik für Informatiker; Verstehen; Graph; algorithms; chordal graphs; claw-free graphs; complexity; computational geometry; edge colorings; graph algorithms; graph partitioning; k-disjoint graph problem; minimum spanning trees; modeling; planar graphs; switch graphs; algorithm analysis and problem complexity; data structures; Geometry; Algorithms; Symbolic and Algebraic Manipulation; Algorithm Analysis and Problem Complexity; Data Structures; Discrete Mathematics in Computer Science; Geometry; Algorithms; Symbolic and Algebraic Manipulation; Data Science; Diskrete Mathematik; Geometrie; Algorithmen und Datenstrukturen; Datenbanken; EA
Graph-Theoretic Solutions to Computational Geometry Problems.- Algorithms for Classes of Graphs with Bounded Expansion.- A Graph Polynomial Arising from Community Structure (Extended Abstract).- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs.- Maximum Series-Parallel Subgraph.- Low-Port Tree Representations.- Fully Dynamic Representations of Interval Graphs.- The Parameterized Complexity of Some Minimum Label Problems.- Exact and Parameterized Algorithms for Max Internal Spanning Tree.- An Exact Algorithm for Minimum Distortion Embedding.- Sub-coloring and Hypo-coloring Interval Graphs.- Parameterized Complexity of Generalized Domination Problems.- Connected Feedback Vertex Set in Planar Graphs.- Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract).- On Module-Composed Graphs.- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees.- The k-Disjoint Paths Problem on Chordal Graphs.- Local Algorithms for Edge Colorings in UDGs.- Directed Rank-Width and Displit Decomposition.- An Algorithmic Study of Switch Graphs.- Hardness Results and Efficient Algorithms for Graph Powers.- Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph.- Injective Oriented Colourings.- Chordal Digraphs.- A New Intersection Model and Improved Algorithms for Tolerance Graphs.- Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes.- Distance d-Domination Games.- Cycles, Paths, Connectivity and Diameter in Distance Graphs.- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract).- Finding Induced Paths of Given Parity in Claw-Free 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...