Graph-Theoretic Concepts in Computer Science
Springer Berlin (Verlag)
978-3-540-52292-8 (ISBN)
Prof. Dr.-Ing. habil. Manfred Nagl ist Inhaber des Lehrstuhls Informatik III an der Rheinisch-Westfälischen Technischen Hochschule Aachen.
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.
| Erscheint lt. Verlag | 7.3.1990 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XI, 377 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 233 mm |
| Gewicht | 690 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | action • algorithm • Algorithm analysis and problem complexity • Algorithmen • algorithms • combinatorics • Complexity • data structure • data structures • Datenstrukturen • Digraph • Distributed Systems • Graph • Graphen • Graphentheorie • graph theory • Informatik • Komplexität • Modeling • Processor • SiM • Software engineering • VLSI |
| ISBN-10 | 3-540-52292-1 / 3540522921 |
| ISBN-13 | 978-3-540-52292-8 / 9783540522928 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
