2026, ISBN: 9783540427070
[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoreti… Mehr…
booklooker.de |
2001, ISBN: 9783540427070
This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, G… Mehr…
Indigo.ca new in stock. Versandkosten:zzgl. Versandkosten. Details... |
Graph-Theoretic Concepts in Computer Science: 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings (Lecture Notes in Computer Science, 2204, Band 2204) - Taschenbuch
2008, ISBN: 9783540427070
Springer, Taschenbuch, Auflage: 2001, 344 Seiten, Publiziert: 2008-06-13T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: Illustrations, 2.36 kg, Datenbanken, Computer & Internet, Kategori… Mehr…
Amazon.de (Intern... lange_und_springer_antiquariat Gut Versandkosten:Auf Lager. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) Details... |
Graph-Theoretic Concepts in Computer Science: 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings (Lecture Notes in Computer Science, 2204, Band 2204) - Taschenbuch
2008, ISBN: 9783540427070
Springer, Taschenbuch, Auflage: 2001, 344 Seiten, Publiziert: 2008-06-13T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: Illustrations, 2.36 kg, Datenbanken, Computer & Internet, Kategori… Mehr…
Amazon.de (Intern... Versandkosten:Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) Details... |
2001, ISBN: 9783540427070
Graph-Theoretic Concepts in Computer Science ab 74.99 € als Taschenbuch: 27th International Workshop WG 2001 Boltenhagen Germany June 14-16 2001 Proceedings. Auflage 2001. Aus dem Bereich… Mehr…
Hugendubel.de Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00) Details... |
2026, ISBN: 9783540427070
[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoreti… Mehr…
2001, ISBN: 9783540427070
This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, G… Mehr…
Graph-Theoretic Concepts in Computer Science: 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings (Lecture Notes in Computer Science, 2204, Band 2204) - Taschenbuch
2008
ISBN: 9783540427070
Springer, Taschenbuch, Auflage: 2001, 344 Seiten, Publiziert: 2008-06-13T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: Illustrations, 2.36 kg, Datenbanken, Computer & Internet, Kategori… Mehr…
Graph-Theoretic Concepts in Computer Science: 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings (Lecture Notes in Computer Science, 2204, Band 2204) - Taschenbuch
2008, ISBN: 9783540427070
Springer, Taschenbuch, Auflage: 2001, 344 Seiten, Publiziert: 2008-06-13T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: Illustrations, 2.36 kg, Datenbanken, Computer & Internet, Kategori… Mehr…
2001, ISBN: 9783540427070
Graph-Theoretic Concepts in Computer Science ab 74.99 € als Taschenbuch: 27th International Workshop WG 2001 Boltenhagen Germany June 14-16 2001 Proceedings. Auflage 2001. Aus dem Bereich… Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science by Andreas Brandst Paperback | Indigo Chapters
EAN (ISBN-13): 9783540427070
ISBN (ISBN-10): 3540427074
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2001
Herausgeber: Andreas Brandst
329 Seiten
Gewicht: 0,520 kg
Buch in der Datenbank seit 2008-03-05T20:58:04+01:00 (Zurich)
Detailseite zuletzt geändert am 2023-01-15T11:21:47+01:00 (Zurich)
ISBN/EAN: 9783540427070
ISBN - alternative Schreibweisen:
3-540-42707-4, 978-3-540-42707-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: andreas brandstädt, andreas bang, brandstaedt, brandsta
Titel des Buches: boltenhagen, graph theoretic concepts computer science, science germany, lecture notes computer science, june, proceedings international workshop, 2001
Daten vom Verlag:
Autor/in: Andreas Brandstädt; Van Bang Le
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings
Verlag: Springer; Springer Berlin
334 Seiten
Erscheinungsjahr: 2001-09-26
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 334 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Computerprogrammierung und Softwareentwicklung; Verstehen; Approximation; Computational Discrete Mathematics; Computational Geometry; Geometric Algorithms; Graph; Graph Coloring; Graph Drawing; Network Algoritms; Optimization; algorithms; computer; computer science; algorithm analysis and problem complexity; data structures; Programming Techniques; Theory of Computation; Data Structures and Information Theory; Algorithms; Discrete Mathematics in Computer Science; Data Science; Theoretische Informatik; Algorithmen und Datenstrukturen; Informationstheorie; Mathematik für Informatiker; Diskrete Mathematik; Datenbanken; EA
Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces.- Data Management in Networks.- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs.- Approximate Constrained Bipartite Edge Coloring.- Maximum Clique Transversals.- On the Tree-Degree of Graphs.- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms.- (k+) -Disatance- Herediatry Graphs.- On the Relationship between Clique-Width and Treewidth.- Planarity of the 2-Level Cactus Model.- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach.- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.- (g, f)-Factorizations Orthogonal to k Subgraphs.- On Star Coloring of Graphs.- Graph Subcolorings: Complexity and Algorithms.- Approximation of Pathwidth of Outerplanar Graphs.- On the Monotonicity of Games Generated by Symmetric Submodular Functions.- Multiple Hotlink Assignment.- Small k-Dominating Sets in Planar Graphs with Applications.- Lower Bounds for Algorithms for the Steiner Tree Problem.- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time.- On Subfamilies of AT-Free Graphs.- Complexity of Coloring Graphs without Forbidden Induced Subgraphs.- On Stable Cutsets in Line Graphs.- On Strong Menger-Connectivity of Star Graphs.- The Complexity of the Matching-Cut Problem.- De Bruijn Graphs and DNA Graphs.- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness.- Critical and Anticritical Edges in Perfect Graphs.Includes supplementary material: sn.pub/extras
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783540363798 Graph-Theoretic Concepts in Computer Science (Ludek Kucera)
- 9783540363798 Graph-Theoretic Concepts in Computer Science (Ludek Kucera)
- 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)
- 9780387538327 Graph-Theoretic Concepts in Computer Science 16th International Workshop Wg 90 Berlin, Germany, June 20-22, 1990, Proc (Rolf H Mohring)
- 9783540003311 [(Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers)] [by: Ludek Kucera] (Ludek Kucera)
- 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...