- 5 Résultats
prix le plus bas: € 4,23, prix le plus élevé: € 53,49, prix moyen: € 17,68
1
Graph-Theoretic Concepts in Computer Science. International Workshop WG '88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings. Lecture notes in computer science ; 344. - Leeuwen, Jan van,
Commander
sur AbeBooks.co.uk
€ 4,23
Envoi: € 7,011
Commander
Détails du fournisseur
Lien sponsorisé
Leeuwen, Jan van,:

Graph-Theoretic Concepts in Computer Science. International Workshop WG '88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings. Lecture notes in computer science ; 344. - Livres de poche

1989, ISBN: 3540507280

[EAN: 9783540507284], [SC: 7.01], [PU: Springer Berlin], GRAPH THEORY,MODELING,GRAPH,COMPUTATIONAL GEOMETRY,ALGORITHM,LOGIC,TRIANGULATION,COMPUTER,SIM,ALGORITHMS,TOPOLOGY,, 462 pages Ex-L… Plus…

Frais d'envoi EUR 7.01 Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Beoordeling: 5 (van 5)]
fermer(X)
2
Graph-Theoretic Concepts in Computer Science. International Workshop WG '88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings. Lecture notes in computer science ; 344. - Leeuwen, Jan van,
Commander
sur ZVAB.com
€ 4,70
Envoi: € 3,001
Commander
Détails du fournisseur
Lien sponsorisé

Leeuwen, Jan van,:

Graph-Theoretic Concepts in Computer Science. International Workshop WG '88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings. Lecture notes in computer science ; 344. - Livres de poche

1989, ISBN: 3540507280

[EAN: 9783540507284], [SC: 3.0], [PU: Springer Berlin], GRAPH THEORY,MODELING,GRAPH,COMPUTATIONAL GEOMETRY,ALGORITHM,LOGIC,TRIANGULATION,COMPUTER,SIM,ALGORITHMS,TOPOLOGY,, 462 pages Ex-Li… Plus…

Frais d'envoi EUR 3.00 Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)]
fermer(X)
3
Graph-Theoretic Concepts in Computer Science - Jan van Leeuwen
Commander
sur Hugendubel.de
€ 53,49
Envoi: € 3,951
Commander
Détails du fournisseur
Lien sponsorisé
Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science - Livres de poche

ISBN: 9783540507284

*Graph-Theoretic Concepts in Computer Science* - International Workshop WG `88 Amsterdam The Netherlands June 15-17 1988. Proceedings. Auflage 1989 / Taschenbuch für 53.49 € / Aus dem Ber… Plus…

Frais d'envoiShipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., zzgl. Versandkosten. (EUR 3.95)
fermer(X)
4
Graph-Theoretic Concepts in Computer Science. International Workshop WG '88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings. Lecture notes in computer science ; 344. - Leeuwen, Jan van,
Commander
sur Achtung-Buecher.de
€ 7,50
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé
Leeuwen, Jan van,:
Graph-Theoretic Concepts in Computer Science. International Workshop WG '88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings. Lecture notes in computer science ; 344. - livre d'occasion

1989, ISBN: 3540507280

462 pages Unbekannter Einband Ex-Library book in very good condition. 9783540507284 Graph theory,modeling,Graph,computational geometry,algorithm,logic,Triangulation,Computer,Sim,algorithm… Plus…

Frais d'envoiVersandkostenfrei innerhalb der BRD. (EUR 0.00) Antiquariat Bookfarm Sebastian Seckfort, 04509 Löbnitz
fermer(X)
5
Graphtheoretic concepts in computer science Teil: 1988., Amsterdam, the Netherlands, June 15 - 17, 1988 / Lecture notes in computer science ; 344 - Leeuwen Jan, van
Commander
sur Achtung-Buecher.de
€ 18,50
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé
Leeuwen Jan, van:
Graphtheoretic concepts in computer science Teil: 1988., Amsterdam, the Netherlands, June 15 - 17, 1988 / Lecture notes in computer science ; 344 - Livres de poche

1989, ISBN: 3540507280

1989 Softcover VII, 457 p. Broschiert Very good condition. Reading pages are very clean and without marks. Slight traces of storage or use. Otherwise very good exemplar. 9783540507284 2,… Plus…

Frais d'envoiVersandkostenfrei innerhalb der BRD. (EUR 0.00) Roland Antiquariat UG (haftungsbeschränkt) Ali Mert, 69469 Weinheim
fermer(X)
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
Auteur:
Titre:
ISBN:

3540507280


This volume presents the proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '88), held from June 15 to 17, 1988 in Amsterdam, The Netherlands. It contains 31 papers on new or current developments in the area of graph-based algorithms. The topics covered include e.g. structural graph theory, parallel graph algorithms, graph-based modeling (in database theory and VLSI), computational geometry and applied graph theory. The book contains the revised versions of all the papers presented at the workshop. The revisions are based on comments and suggestions received by the authors during and after the workshop.

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


EAN (ISBN-13): 9783540507284
ISBN (ISBN-10): 3540507280
Version reliée
Livre de poche
Date de parution: 1989
Editeur: Springer Berlin Heidelberg
459 Pages
Poids: 0,707 kg

Livre dans la base de données depuis 2007-02-18T15:35:36+01:00 (Zurich)
Page de détail modifiée en dernier sur 2024-03-04T10:33:23+01:00 (Zurich)
ISBN/EAN: 3540507280

ISBN - Autres types d'écriture:
3-540-50728-0, 978-3-540-50728-4
Autres types d'écriture et termes associés:
Auteur du livre: leeuwen van, jan leeuw, goos, lee
Titre du livre: netherlands, graph theoretic concepts computer science, lecture notes computer science, proceedings amsterdam, proceedings international workshop, the

Données de l'éditeur

Auteur: Jan van Leeuwen
Titre: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - International Workshop WG `88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings
Editeur: Springer; Springer Berlin
462 Pages
Date de parution: 1989-01-25
Berlin; Heidelberg; DE
Imprimé / Fabriqué en
Poids: 1,450 kg
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
X, 462 p.

BC; Combinatorics; Hardcover, Softcover / Mathematik/Sonstiges; Diskrete Mathematik; Verstehen; Computer; Graph; Graph theory; Sim; Triangulation; algorithm; algorithms; computational geometry; logic; modeling; topology; combinatorics; algorithm analysis and problem complexity; data structures; Mathematics, general; Computer System Implementation; Algorithm Analysis and Problem Complexity; Data Structures; Computer Graphics; Discrete Mathematics; Mathematics; Computer System Implementation; Algorithms; Data Science; Computer Graphics; Mathematik; Systemanalyse und -design; Algorithmen und Datenstrukturen; Datenbanken; Grafikprogrammierung; EA

NC-algorithms for graphs with small treewidth.- Graph-theoretic properties compatible with graph derivations.- The monadic second-order logic of graphs : Definable sets of finite graphs.- On systems of equations defining infinite graphs.- Fault tolerant networks of specified diameter.- DFS tree construction: Algorithms and characterizations.- Serializable graphs.- Transitive closure algorithms for very large databases.- A graph-based decomposition approach for recursive query processing.- Construction of deterministic transition graphs from dynamic integrity constraints.- (Time × space)-efficient implementations of hlerarchical conceptual models.- Dominance in the presence of obstacles.- Separating a polyhedron by one translation from a set of obstacles.- Linear time algorithms for testing approximate congruence in the plane.- Moving regular k-gons in contact.- Epsilon-nets for halfplanes.- Greedy triangulation can be efficiently implemented in the average case.- A simple systolic method to find all bridges of an undirected graph.- Colouring perfect planar graphs in parallel.- An efficient parallel algorithm for the all pairs shortest path problem.- A parallel algorithm for channel routing.- Application of graph theory to topology generation for logic gates.- On the estimate of the size of a directed graph.- The average size of ordered binary subgraphs.- O(n2) algorithms for graph planarization.- Bandwidth and profile minimization.- On the spanning trees of weighted graphs.- On paths in search or decision trees which require almost worst-case time.- A time-optimal parallel algorithm for the computing of Voronoi-diagrams.- Voronoi diagrams in the moscow metric.- A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited.
< pour archiver...