- 5 Ergebnisse
Kleinster Preis: € 52,46, größter Preis: € 57,71, Mittelwert: € 54,85
1
Graph-Theoretic Concepts in Computer Science : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers - Dieter Kratsch
Bestellen
bei ZVAB.com
€ 52,46
Versand: € 0,001
Bestellengesponserter Link
Dieter Kratsch:

Graph-Theoretic Concepts in Computer Science : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers - Taschenbuch

2005, ISBN: 3540310002

[EAN: 9783540310006], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], GRAPH - GRAPHENTHEORIE; GRAPH; ALGORITHM; ALGORITHMICGEOMETRY; ALGORITHMICGRAPHTHEORY; APPROXIMATION; COMBINATO… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
2
Graph-Theoretic Concepts in Computer Science : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers - Dieter Kratsch
Bestellen
bei ZVAB.com
€ 57,71
Versand: € 0,001
Bestellengesponserter Link

Dieter Kratsch:

Graph-Theoretic Concepts in Computer Science : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers - Taschenbuch

2005, ISBN: 3540310002

[EAN: 9783540310006], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], GRAPH - GRAPHENTHEORIE; GRAPH; ALGORITHM; ALGORITHMICGEOMETRY; ALGORITHMICGRAPHTHEORY; APPROXIMATION; COMBINATO… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
3
Graph-Theoretic Concepts in Computer Science - Dieter Kratsch
Bestellen
bei booklooker.de
€ 53,49
Versand: € 0,001
Bestellengesponserter Link
Dieter Kratsch:
Graph-Theoretic Concepts in Computer Science - Taschenbuch

2013

ISBN: 9783540310006

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - The 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005) was held on the campus Ile du Saul… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) AHA-BUCH GmbH
4
Graph-Theoretic Concepts in Computer Science: 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers Dieter Kra
Bestellen
bei BarnesandNoble.com
€ 54,99
Bestellengesponserter Link
Graph-Theoretic Concepts in Computer Science: 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers Dieter Kra - neues Buch

2005, ISBN: 9783540310006

The 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005) was held on the campus Ile du Saulcy of the Univ- sity Paul Verlaine-Metz in France. The workshop… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
5
Graph-Theoretic Concepts in Computer Science 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers - Kratsch, Dieter (Herausgeber)
Bestellen
bei Achtung-Buecher.de
€ 55,60
Versand: € 0,001
Bestellengesponserter Link
Kratsch, Dieter (Herausgeber):
Graph-Theoretic Concepts in Computer Science 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers - neues Buch

2005, ISBN: 3540310002

2005 Kartoniert / Broschiert Graph - Graphentheorie, Diskrete Mathematik, Algorithmen und Datenstrukturen, Datenbanken, Theoretische Informatik, Mathematik für Informatiker, Computermod… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien

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
Graph-Theoretic Concepts in Computer Science: 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers Dieter Kra

This book constitutes the thoroughly refereed post-proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2005, held in Metz, France in June 2005.The 38 revised full papers presented together with 2 invited papers were carefully selected from 125 submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms, and graph-theoretical applications in various fields. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research.

Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science: 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers Dieter Kra


EAN (ISBN-13): 9783540310006
ISBN (ISBN-10): 3540310002
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2005
Herausgeber: Springer Berlin Heidelberg Core >1
492 Seiten
Gewicht: 0,737 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-06-04T05:21:07+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-02-07T06:07:01+01:00 (Zurich)
ISBN/EAN: 9783540310006

ISBN - alternative Schreibweisen:
3-540-31000-2, 978-3-540-31000-6
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: paul verlaine
Titel des Buches: theoretical computer science, metz, graph theoretic concepts computer science, general papers, france then now, 2005


Daten vom Verlag:

Autor/in: Dieter Kratsch
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Graph-Theoretic Concepts in Computer Science - 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers
Verlag: Springer; Springer Berlin
478 Seiten
Erscheinungsjahr: 2005-12-13
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIV, 478 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; Graph; algorithm; algorithmic geometry; algorithmic graph theory; approximation; combinatorial optimization; complexity theory; computational discrete mathematics; computer; computer science; graph algorithms; graph coloring; graph computations; graph decomposition; algorithm analysis and problem complexity; data structures; Theory of Computation; Computer Modelling; Algorithms; Discrete Mathematics in Computer Science; Numerical Analysis; Data Science; Computermodellierung und -simulation; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; Datenbanken; EA

Invited Lectures.- Hypertree Decompositions: Structure, Algorithms, and Applications.- Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey.- Regular Papers.- Domination Search on Graphs with Low Dominating-Target-Number.- Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs.- Approximating Rank-Width and Clique-Width Quickly.- Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.- Minimizing NLC-Width is NP-Complete.- Channel Assignment and Improper Choosability of Graphs.- Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time.- Roman Domination over Some Graph Classes.- Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms.- Network Discovery and Verification.- Complete Graph Drawings Up to Triangle Mutations.- Collective Tree 1-Spanners for Interval Graphs.- On Stable Cutsets in Claw-Free Graphs and Planar Graphs.- Induced Subgraphs of Bounded Degree and Bounded Treewidth.- Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time.- Ultimate Generalizations of LexBFS and LEX M.- Adding an Edge in a Cograph.- The Computational Complexity of Delay Management.- Acyclic Choosability of Graphs with Small Maximum Degree.- Generating Colored Trees.- Optimal Hypergraph Tree-Realization.- Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints.- On the Fixed-Parameter Enumerability of Cluster Editing.- Locally Consistent Constraint Satisfaction Problems with Binary Constraints.- On Randomized Broadcasting in Star Graphs.- Finding Disjoint Paths on Directed Acyclic Graphs.- Approximation Algorithms for the Bi-criteria Weighted max-cut Problem.- Approximation Algorithms for the Weighted Independent Set Problem.- Approximation Algorithms for Unit Disk Graphs.- Computation of Chromatic Polynomials Using Triangulations and Clique Trees.- Computing Branchwidth Via Efficient Triangulations and Blocks.- Algorithms Based on the Treewidth of Sparse Graphs.- Extending the Tractability Border for Closest Leaf Powers.- Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model.- Algebraic Operations on PQ Trees and Modular Decomposition Trees.- Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.- Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny.- Recognizing HHDS-Free Graphs.

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9783030604394 Graph-Theoretic Concepts in Computer Science (Adler, Isolde Mueller, Haiko)


< zum Archiv...