- 5 resultaten
laagste prijs: € 4,23, hoogste prijs: € 53,49, gemiddelde prijs: € 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,
bestellen
bij AbeBooks.co.uk
€ 4,23
verzending: € 7,011
bestellen
Details aangeboden
Gesponsorde link
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. - pocketboek

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… Meer...

Verzendingskosten: EUR 7.01 Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Beoordeling: 5 (van 5)]
dichtslaan (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,
bestellen
bij ZVAB.com
€ 4,70
verzending: € 3,001
bestellen
Details aangeboden
Gesponsorde link

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. - pocketboek

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… Meer...

Verzendingskosten: EUR 3.00 Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)]
dichtslaan (X)
3
Graph-Theoretic Concepts in Computer Science - Jan van Leeuwen
bestellen
bij Hugendubel.de
€ 53,49
verzending: € 3,951
bestellen
Details aangeboden
Gesponsorde link
Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science - pocketboek

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… Meer...

Verzendingskosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., zzgl. Versandkosten. (EUR 3.95)
dichtslaan (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,
bestellen
bij Achtung-Buecher.de
€ 7,50
verzending: € 0,001
bestellen
Details aangeboden
Gesponsorde link
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. - gebruikt boek

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… Meer...

Verzendingskosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Antiquariat Bookfarm Sebastian Seckfort, 04509 Löbnitz
dichtslaan (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
bestellen
bij Achtung-Buecher.de
€ 18,50
verzending: € 0,001
bestellen
Details aangeboden
Gesponsorde link
Leeuwen Jan, van:
Graphtheoretic concepts in computer science Teil: 1988., Amsterdam, the Netherlands, June 15 - 17, 1988 / Lecture notes in computer science ; 344 - pocketboek

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,… Meer...

Verzendingskosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Roland Antiquariat UG (haftungsbeschränkt) Ali Mert, 69469 Weinheim
dichtslaan (X)
1Aangezien sommige platformen geen verzendingsvoorwaarden meedelen en deze kunnen afhangen van het land van levering, de aankoopprijs, het gewicht en de grootte van het artikel, een eventueel lidmaatschap van het platform, een rechtstreekse levering door het platform of via een derde aanbieder (Marktplaats), enz., is het mogelijk dat de door euro-boek.nl meegedeelde verzendingskosten niet overeenstemmen met deze van het aanbiedende platform.

Bibliografische gegevens van het best passende boek

Bijzonderheden over het boek
Graph-Theoretic Concepts in Computer Science
auteur:
Titel:
ISBN:

9783540507284


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.

Gedetalleerde informatie over het boek. - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540507284
ISBN (ISBN-10): 3540507280
Gebonden uitgave
pocket book
Verschijningsjaar: 1989
Uitgever: Springer Berlin Heidelberg
459 Bladzijden
Gewicht: 0,707 kg

Boek bevindt zich in het datenbestand sinds 2007-02-18T15:35:36+01:00 (Amsterdam)
Detailpagina laatst gewijzigd op 2024-03-04T10:33:23+01:00 (Amsterdam)
ISBN/EAN: 9783540507284

ISBN - alternatieve schrijfwijzen:
3-540-50728-0, 978-3-540-50728-4
alternatieve schrijfwijzen en verwante zoekwoorden:
Auteur van het boek: leeuwen van, jan leeuw, goos, lee
Titel van het boek: netherlands, graph theoretic concepts computer science, lecture notes computer science, proceedings amsterdam, proceedings international workshop, the

Gegevens van de uitgever

Auteur: Jan van Leeuwen
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - International Workshop WG `88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings
Uitgeverij: Springer; Springer Berlin
462 Bladzijden
Verschijningsjaar: 1989-01-25
Berlin; Heidelberg; DE
Gedrukt / Gemaakt in
Gewicht: 1,450 kg
Taal: Engels
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.
< naar Archief...