- 5 Résultats
prix le plus bas: € 53,49, prix le plus élevé: € 85,59, prix moyen: € 61,61
1
Graph-Theoretic Concepts in Computer Science : 15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings - Manfred Nagl
Commander
sur ZVAB.com
€ 59,11
Envoi: € 0,001
CommanderLien sponsorisé
Manfred Nagl:

Graph-Theoretic Concepts in Computer Science : 15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings - Livres de poche

1990, ISBN: 3540522921

[EAN: 9783540522928], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], GRAFIK (EDV); DISTRIBUTEDSYSTEMS; MODELING; PROCESSOR; SOFTWAREENGINEERING; COMBINATORICS; ALGORITHMANALYSISAND… Plus…

NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
2
Graph-Theoretic Concepts in Computer Science - Manfred Nagl
Commander
sur booklooker.de
€ 53,49
Envoi: € 0,001
CommanderLien sponsorisé

Manfred Nagl:

Graph-Theoretic Concepts in Computer Science - Livres de poche

2007, ISBN: 9783540522928

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - The aim of this workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. Co… Plus…

Frais d'envoiVersandkostenfrei, Versand nach Deutschland. (EUR 0.00) AHA-BUCH GmbH
3
Graph-Theoretic Concepts in Computer Science - Manfred Nagl
Commander
sur booklooker.de
€ 85,59
Envoi: € 0,001
CommanderLien sponsorisé
Manfred Nagl:
Graph-Theoretic Concepts in Computer Science - Livres de poche

2007

ISBN: 9783540522928

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - The aim of this workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. Co… Plus…

Frais d'envoiVersandkostenfrei, Versand nach Deutschland. (EUR 0.00) BuchWeltWeit Inh. Ludwig Meier e.K.
4
Graph-Theoretic Concepts in Computer Science - Manfred Nagl
Commander
sur Hugendubel.de
€ 53,49
Envoi: € 0,001
CommanderLien sponsorisé
Manfred Nagl:
Graph-Theoretic Concepts in Computer Science - Livres de poche

ISBN: 9783540522928

*Graph-Theoretic Concepts in Computer Science* - 15th International Workshop WG '89 Castle Rolduc The Netherlands June 14-16 1989 Proceedings. Auflage 1990 / Taschenbuch für 53.49 € / Aus… Plus…

Frais d'envoiShipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)
5
Graph-Theoretic Concepts in Computer Science : 15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings - Nagl, Manfred
Commander
sur Blackwells.co.uk
£ 48,45
(environ € 56,38)
Envoi: € 7,561
CommanderLien sponsorisé
Nagl, Manfred:
Graph-Theoretic Concepts in Computer Science : 15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings - Livres de poche

ISBN: 9783540522928

paperback, [PU: Springer, Berlin/Heidelberg]

in stock. Frais d'envoiUnknown. (EUR 7.56) Blackwells.co.uk

1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre
Graph-Theoretic Concepts in Computer Science

The aim of this workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. Commonalities between various fields of specialization in computer science may be detected by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. Applications dealt with in this volume include the use of graph-theoretic concepts in distributed and parallel computation, VLSI, CAD, software engineering, computer graphics, data structures, and computational geometry.

Informations détaillées sur le livre - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540522928
ISBN (ISBN-10): 3540522921
Livre de poche
Date de parution: 1990
Editeur: Springer Berlin Heidelberg
374 Pages
Poids: 0,585 kg

Livre dans la base de données depuis 2007-05-28T14:08:50+02:00 (Paris)
Page de détail modifiée en dernier sur 2024-02-07T06:07:00+01:00 (Paris)
ISBN/EAN: 9783540522928

ISBN - Autres types d'écriture:
3-540-52292-1, 978-3-540-52292-8
Autres types d'écriture et termes associés:
Auteur du livre: manfred nagl
Titre du livre: 1989, graph theoretic concepts computer science, lecture notes computer science, rolduc, castle, june, proceedings international workshop


Données de l'éditeur

Auteur: Manfred Nagl
Titre: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings
Editeur: Springer; Springer Berlin
377 Pages
Date de parution: 1990-03-07
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XI, 377 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Algorithmen und Datenstrukturen; Verstehen; Action; Algorithms; Digraph; Graph; Graph theory; Sim; VLSI; algorithm; complexity; data structure; data structures; distributed systems; modeling; processor; software engineering; combinatorics; algorithm analysis and problem complexity; Data Structures and Information Theory; Compilers and Interpreters; Software Engineering; Discrete Mathematics; Algorithms; Theory of Computation; Informationstheorie; Compiler und Übersetzer; Software Engineering; Diskrete Mathematik; Theoretische Informatik; EA

Disjoint paths in the hypercube.- Time bounds for broadcasting in bounded degree graphs.- t/s-Diagnosable systems: A characterization and diagnosis algorithm.- Toward a complete representation of graphoids in graphs — Abridged Version.- CADULA — A graph-based model for monitoring CAD-processes.- On hyperedge replacement and BNLC graph grammars.- Graph rewriting systems with priorities.- Filtering hyperedge-replacement languages through compatible properties.- Describing distributed systems by categorical graph grammars.- A parser for context free plex grammars.- to PROGRESS, an attribute graph grammar based specification language.- On the complexity of optimal drawings of graphs.- Bounds to the page number of partially ordered sets.- Beyond Steiner's problem: A VLSI oriented generalization.- A fast sequential and parallel algorithm for the computation of the k-closure of a graph.- On feedback problems in digraphs.- Improved self-reduction algorithms for graphs with bounded treewidth.- Finding a minimal transitive reduction in a strongly connected digraph within linear time.- Paging binary trees with external balancing.- The complexity of graph problems for succinctly represented graphs.- An O(n log n) algorithm for 1-D tile compaction.- Weighted parallel triangulation of simple polygons.- Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry.- k — Nearest — Neighbor Voronoi diagrams for sets of convex polygons, line segments and points.- Finding squares and rectangles in sets of points.- Combinatorial properties of abstract Voronoi diagrams.

< pour archiver...