- 5 Ergebnisse
Kleinster Preis: € 76,78, größter Preis: € 119,00, Mittelwert: € 98,75
1
Graph-Theoretic Concepts in Computer Science - >100
Bestellen
bei ebooks.com
€ 119,00
Bestellen
Details und Versand
gesponserter Link
>100:

Graph-Theoretic Concepts in Computer Science - neues Buch

2005, ISBN: 9783540314684

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 worksh… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
2
Graph-Theoretic Concepts in Computer Science - Springer
Bestellen
bei Orellfuessli.ch
CHF 127,90
(ca. € 110,89)
Versand: € 15,611
Bestellen
Details beim Anbieter
gesponserter Link

Springer:

Graph-Theoretic Concepts in Computer Science - neues Buch

2005, ISBN: 9783540314684

31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers… Mehr…

  - No. 44256940. Versandkosten:Zzgl. Versandkosten. (EUR 15.61)
zuklappen (X)
3
Bestellen
bei hive.co.uk
£ 68,85
(ca. € 76,78)
Bestellen
Details und Versand
gesponserter Link
Oliver Fratzscher:
Graph-Theoretic Concepts in Computer Science : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers - neues Buch

2005

ISBN: 9783540314684

; PDF; Computing > Graphical & digital media applications > 3D graphics & modelling, Physica-Verlag HD

No. 9783540314684. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
zuklappen (X)
4
Bestellen
bei lehmanns.de
€ 93,69
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Dieter Kratsch:
Graph-Theoretic Concepts in Computer Science - neues Buch

2005, ISBN: 9783540314684

31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, eBooks, eBook Download (PDF), [PU: Springer Berlin Heidelberg], Springer Berlin Heidelberg, … Mehr…

Versandkosten:Download sofort lieferbar. (EUR 0.00)
zuklappen (X)
5
Bestellen
bei lehmanns.de
€ 93,39
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Dieter Kratsch:
Graph-Theoretic Concepts in Computer Science - neues Buch

2005, ISBN: 9783540314684

31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, eBook Download (PDF), eBooks, [PU: Springer Berlin Heidelberg]

Versandkosten:Download sofort lieferbar, , Versandkostenfrei innerhalb der BRD. (EUR 0.00)
zuklappen (X)
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
Autor:
Titel:
ISBN-Nummer:

9783540314684

Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540314684
Erscheinungsjahr: 2005
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-04-17T03:39:27+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-02-05T20:20:07+01:00 (Zurich)
ISBN/EAN: 9783540314684

ISBN - alternative Schreibweisen:
978-3-540-31468-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: fratzscher
Titel des Buches: metz, graph theoretic concepts computer science

Daten vom Verlag:

Autor/in: Dieter Kratsch
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; 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-06
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIV, 478 p.

EA; E107; eBook; Nonbooks, PBS / 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; C; Theory of Computation; Computer Modelling; Algorithms; Discrete Mathematics in Computer Science; Numerical Analysis; Data Science; Computer Science; Computermodellierung und -simulation; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; Datenbanken; BC

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.
< zum Archiv...