- 3 Ergebnisse
Kleinster Preis: € 67,40, größter Preis: € 67,82, Mittelwert: € 67,68
1
Graph-Theoretic Concepts in Computer Science - Manfred Nagl
Bestellen
bei Springer.com
€ 67,40
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Manfred Nagl:

Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540469506

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

new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00)
zuklappen (X)
2
Graph-Theoretic Concepts in Computer Science - Manfred Nagl
Bestellen
bei Springer.com
€ 67,82
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link

Manfred Nagl:

Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540469506

Computer Science; Data Structures, Cryptology and Information Theory; Programming Languages, Compilers, Interpreters; Software Engineering/Programming and Operating Systems; Combinatorics… Mehr…

  - Versandkosten: EUR 0.00
zuklappen (X)
3
Graph-Theoretic Concepts in Computer Science - Manfred Nagl
Bestellen
bei Springer.com
€ 67,82
Bestellen
Details und Versand
gesponserter Link
Manfred Nagl:
Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540469506

Computer Science; Data Structures, Cryptology and Information Theory; Programming Languages, Compilers, Interpreters; Software Engineering/Programming and Operating Systems; Combinatorics… 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:

9783540469506

Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science


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

Buch in der Datenbank seit 2017-02-08T00:53:37+01:00 (Zurich)
Detailseite zuletzt geändert am 2021-09-23T16:04:43+02:00 (Zurich)
ISBN/EAN: 9783540469506

ISBN - alternative Schreibweisen:
978-3-540-46950-6
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: nagl
Titel des Buches: graph theoretic concepts computer science

Daten vom Verlag:

Autor/in: Manfred Nagl
Titel: 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
Verlag: Springer; Springer Berlin
377 Seiten
Erscheinungsjahr: 2005-07-13
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XI, 377 p.

EA; E107; eBook; Nonbooks, PBS / 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; C; Data Structures and Information Theory; Compilers and Interpreters; Software Engineering; Discrete Mathematics; Algorithms; Theory of Computation; Computer Science; Informationstheorie; Compiler und Übersetzer; Software Engineering; Diskrete Mathematik; Theoretische Informatik; BC

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.
Proceedings of a workshop which aims to integrate theory and applications, and to find out mechanisms, concepts or tools which facilitate the implementation of solutions based on graphs. Numerous applications are covered.
< zum Archiv...