- 4 Ergebnisse
Kleinster Preis: € 74,96, größter Preis: € 74,96, Mittelwert: € 74,96
1
Graph-Theoretic Concepts in Computer Science - Jan van Leeuwen
Bestellen
bei Springer.com
€ 74,96
Bestellen
Details und Versand
gesponserter Link
Jan van Leeuwen:

Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540460763

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

  - new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
2
Graph-Theoretic Concepts in Computer Science - Jan van Leeuwen
Bestellen
bei Springer.com
€ 74,96
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link

Jan van Leeuwen:

Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540460763

Mathematics; Combinatorics; Mathematics, general; Computer System Implementation; Algorithm Analysis and Problem Complexity; Data Structures; Computer Graphics Computer, Graph, Graph theo… Mehr…

  - Versandkosten: EUR 0.00
zuklappen (X)
3
Graph-Theoretic Concepts in Computer Science - Jan van Leeuwen
Bestellen
bei Springer.com
€ 74,96
Bestellen
Details und Versand
gesponserter Link
Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540460763

Mathematics; Combinatorics; Mathematics, general; Computer System Implementation; Algorithm Analysis and Problem Complexity; Data Structures; Computer Graphics Computer, Graph, Graph theo… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
4
Graph-Theoretic Concepts in Computer Science - Jan van Leeuwen
Bestellen
bei Springer.com
€ 74,96
Bestellen
Details und Versand
gesponserter Link
Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540460763

Mathematics; Combinatorics; Mathematics, general; Computer System Implementation; Algorithm Analysis and Problem Complexity; Data Structures; Computer Graphics Computer, Graph, Graph theo… Mehr…

  - Versandkosten:zzgl. Versandkosten.
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:

9783540460763

Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540460763
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-03-24T14:25:31+01:00 (Zurich)
Detailseite zuletzt geändert am 2021-04-27T13:48:10+02:00 (Zurich)
ISBN/EAN: 9783540460763

ISBN - alternative Schreibweisen:
978-3-540-46076-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: van leeuwen
Titel des Buches: graph theoretic concepts computer science

Daten vom Verlag:

Autor/in: 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
Verlag: Springer; Springer Berlin
462 Seiten
Erscheinungsjahr: 2005-06-30
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
X, 462 p.

EA; E107; eBook; Nonbooks, PBS / 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; C; Discrete Mathematics; Mathematics; Computer System Implementation; Algorithms; Data Science; Computer Graphics; Computer Science; Mathematik; Systemanalyse und -design; Algorithmen und Datenstrukturen; Datenbanken; Grafikprogrammierung; BC

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