Graph-Theoretic Concepts in Computer Science
15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16,1989. Proceedings
(Sprache: Englisch)
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 computer science may be detected by applying graph-theoretic concepts. The...
Leider schon ausverkauft
versandkostenfrei
Buch
85.59 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Graph-Theoretic Concepts in Computer Science “
Klappentext zu „Graph-Theoretic Concepts in Computer Science “
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 computer science may be detected by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. Applications dealt with in this volume include the use of graph-theoretic concepts in distributed and parallel computation, VLSI, CAD, software engineering, computer graphics, data structures, and computational geometry.
Inhaltsverzeichnis zu „Graph-Theoretic Concepts in Computer Science “
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.
Autoren-Porträt
Prof. Dr.-Ing. habil. Manfred Nagl ist Inhaber des Lehrstuhls Informatik III an der Rheinisch-Westfälischen Technischen Hochschule Aachen.
Bibliographische Angaben
- 1990, 1990, 377 Seiten, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Ed. by Manfred Nagl
- Herausgegeben: Manfred Nagl
- Verlag: Springer
- ISBN-10: 3540522921
- ISBN-13: 9783540522928
- Erscheinungsdatum: 07.03.1990
Sprache:
Englisch
Kommentar zu "Graph-Theoretic Concepts in Computer Science"
0 Gebrauchte Artikel zu „Graph-Theoretic Concepts in Computer Science“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Graph-Theoretic Concepts in Computer Science".
Kommentar verfassen