Graph-Theoretic Concepts in Computer Science : 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers - neues Buch
2009, ISBN: 9783642114090
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 th… Mehr…
hive.co.uk No. 9783642114090. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten. Details... |
2010, ISBN: 9783642114090
35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers, eBooks, eBook Download (PDF), 2010, The 35th International Workshop on Graph-Theoretic Concept… Mehr…
lehmanns.de Versandkosten:Download sofort lieferbar. (EUR 0.00) Details... |
2009, ISBN: 9783642114090
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… Mehr…
Springer.com new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00) Details... |
2009, ISBN: 9783642114090
Graph-Theoretic Concepts in Computer Science - 35th International Workshop WG 2009 Montpellier France June 24-26 2009 Revised Papers: ab 79.99 € eBooks > Fachthemen & Wissenschaft > Mathe… Mehr…
eBook.de Versandkosten:in stock, , , DE. (EUR 0.00) Details... |
2010, ISBN: 9783642114090
35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers, eBooks, eBook Download (PDF), 2010, [PU: Springer Berlin], Springer Berlin, 2010
lehmanns.de Versandkosten:Download sofort lieferbar. (EUR 0.00) Details... |
Graph-Theoretic Concepts in Computer Science : 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers - neues Buch
2009, ISBN: 9783642114090
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 th… Mehr…
2010, ISBN: 9783642114090
35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers, eBooks, eBook Download (PDF), 2010, The 35th International Workshop on Graph-Theoretic Concept… Mehr…
2009
ISBN: 9783642114090
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… Mehr…
2009, ISBN: 9783642114090
Graph-Theoretic Concepts in Computer Science - 35th International Workshop WG 2009 Montpellier France June 24-26 2009 Revised Papers: ab 79.99 € eBooks > Fachthemen & Wissenschaft > Mathe… Mehr…
2010, ISBN: 9783642114090
35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers, eBooks, eBook Download (PDF), 2010, [PU: Springer Berlin], Springer Berlin, 2010
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science
EAN (ISBN-13): 9783642114090
ISBN (ISBN-10): 3642114091
Erscheinungsjahr: 2010
Herausgeber: Springer Berlin
13 Seiten
Sprache: eng/Englisch
Buch in der Datenbank seit 2011-08-16T07:35:14+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-11-04T22:55:40+01:00 (Zurich)
ISBN/EAN: 9783642114090
ISBN - alternative Schreibweisen:
3-642-11409-1, 978-3-642-11409-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: paul christ, christoph michel, michel christop, paul häb, paul christophe
Titel des Buches: montpellier, graph theoretic concepts computer science
Daten vom Verlag:
Autor/in: Christophe Paul; Michel Habib
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; 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: 2009-12-03
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIII, 353 p.
EA; E107; eBook; Nonbooks, PBS / 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; C; Discrete Mathematics in Computer Science; 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; Computer Science; Diskrete Mathematik; Geometrie; Algorithmen und Datenstrukturen; Datenbanken; BC
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...