- 5 resultados
menor preço: € 4,23, preço mais alto: € 53,49, preço médio: € 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,
Encomendar
no/na AbeBooks.co.uk
€ 4,23
Envio: € 7,011
Encomendar
Detalhes fornecedor
Link patrocinado
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. - Livro de bolso

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… mais…

Custos de envio: EUR 7.01 Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Beoordeling: 5 (van 5)]
fechar(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,
Encomendar
no/na ZVAB.com
€ 4,70
Envio: € 3,001
Encomendar
Detalhes fornecedor
Link patrocinado

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. - Livro de bolso

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… mais…

Custos de envio: EUR 3.00 Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)]
fechar(X)
3
Graph-Theoretic Concepts in Computer Science - Jan van Leeuwen
Encomendar
no/na Hugendubel.de
€ 53,49
Envio: € 3,951
Encomendar
Detalhes fornecedor
Link patrocinado
Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science - Livro de bolso

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… mais…

Custos de envio:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., zzgl. Versandkosten. (EUR 3.95)
fechar(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,
Encomendar
no/na Achtung-Buecher.de
€ 7,50
Envio: € 0,001
Encomendar
Detalhes fornecedor
Link patrocinado
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. - livro usado

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… mais…

Custos de envio:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Antiquariat Bookfarm Sebastian Seckfort, 04509 Löbnitz
fechar(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
Encomendar
no/na Achtung-Buecher.de
€ 18,50
Envio: € 0,001
Encomendar
Detalhes fornecedor
Link patrocinado
Leeuwen Jan, van:
Graphtheoretic concepts in computer science Teil: 1988., Amsterdam, the Netherlands, June 15 - 17, 1988 / Lecture notes in computer science ; 344 - Livro de bolso

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,… mais…

Custos de envio:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Roland Antiquariat UG (haftungsbeschränkt) Ali Mert, 69469 Weinheim
fechar(X)
1Como algumas plataformas não transmitem condições de envio e estas podem depender do país de entrega, do preço de compra, do peso e tamanho do artigo, de uma possível adesão à plataforma, de uma entrega directa pela plataforma ou através de um terceiro fornecedor (Marketplace), etc., é possível que os custos de envio indicados pelo eurolivro não correspondam aos da plataforma ofertante.

Dados bibliográficos do melhor livro correspondente

Pormenores referentes ao livro
Graph-Theoretic Concepts in Computer Science
Autor:
Título:
Número 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.

Dados detalhados do livro - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540507284
ISBN (ISBN-10): 3540507280
Livro de capa dura
Livro de bolso
Ano de publicação: 1989
Editor/Editora: Springer Berlin Heidelberg
459 Páginas
Peso: 0,707 kg

Livro na base de dados desde 2007-02-18T14:35:36+00:00 (Lisbon)
Página de detalhes modificada pela última vez em 2024-03-04T09:33:23+00:00 (Lisbon)
Número ISBN/EAN: 3540507280

Número ISBN - Ortografia alternativa:
3-540-50728-0, 978-3-540-50728-4
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: leeuwen van, jan leeuw, goos, lee
Título do livro: netherlands, graph theoretic concepts computer science, lecture notes computer science, proceedings amsterdam, proceedings international workshop, the

Dados da editora

Autor: Jan van Leeuwen
Título: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - International Workshop WG `88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings
Editora: Springer; Springer Berlin
462 Páginas
Ano de publicação: 1989-01-25
Berlin; Heidelberg; DE
Impresso / Feito em
Peso: 1,450 kg
Língua: Inglês
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.
< Para arquivar...