Graph-Theoretic Concepts in Computer Science de Manfred Nagl

Graph-Theoretic Concepts in Computer Science: 15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings: Lecture Notes in Computer Science, cartea 411

Manfred Nagl

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.

Citește tot Restrânge

	Preț	Express
Paperback (2)	324^.35 lei 6-8 săpt.
Springer Berlin, Heidelberg – 7 mar 1990	324^.35 lei 6-8 săpt.
Springer Berlin, Heidelberg – 17 noi 1995	380^.46 lei 6-8 săpt.

Preț

Express

Paperback (2)

324^.35 lei 6-8 săpt.

Springer Berlin, Heidelberg – 7 mar 1990

324^.35 lei 6-8 săpt.

Springer Berlin, Heidelberg – 17 noi 1995

380^.46 lei 6-8 săpt.

Din seria Lecture Notes in Computer Science

20%

Preț: 461^.83 lei
20%

Preț: 461^.57 lei
20%

Preț: 424^.26 lei
20%

Preț: 390^.69 lei
20%

Preț: 498^.50 lei
15%

Preț: 388^.50 lei
20%

Preț: 390^.35 lei
20%

Preț: 460^.98 lei
20%

Preț: 461^.52 lei
20%

Preț: 497^.55 lei
20%

Preț: 389^.72 lei
20%

Preț: 461^.83 lei
20%

Preț: 389^.90 lei
20%

Preț: 497^.04 lei
20%

Preț: 462^.05 lei
20%

Preț: 391^.14 lei
20%

Preț: 389^.85 lei
20%

Preț: 461^.32 lei
20%

Preț: 498^.32 lei
20%

Preț: 496^.64 lei
20%

Preț: 532^.28 lei
20%

Preț: 527^.36 lei
20%

Preț: 498^.46 lei
15%

Preț: 461^.85 lei
20%

Preț: 390^.12 lei
20%

Preț: 532^.41 lei
20%

Preț: 462^.24 lei
20%

Preț: 391^.14 lei
20%

Preț: 461^.77 lei
20%

Preț: 390^.35 lei
20%

Preț: 461^.06 lei
20%

Preț: 461^.65 lei
20%

Preț: 390^.18 lei
20%

Preț: 392^.64 lei
20%

Preț: 252^.15 lei
20%

Preț: 390^.94 lei
20%

Preț: 461^.52 lei
20%

Preț: 391^.86 lei
20%

Preț: 532^.54 lei
20%

Preț: 462^.67 lei
20%

Preț: 461^.65 lei
20%

Preț: 639^.72 lei
20%

Preț: 255^.91 lei
15%

Preț: 535^.92 lei
20%

Preț: 535^.77 lei
5%

Preț: 516^.27 lei
20%

Preț: 499^.36 lei
20%

Preț: 391^.20 lei
20%

Preț: 391^.20 lei
20%

Preț: 249^.95 lei

Cuprins

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.