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.

Contenuti:

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

Quality books, speedy shipping, and great customer service! Please note that used items may not include access codes or cards, CD's or other accessories, regardless of what is stated in item title. If you need to guarantee that these items are included, please purchase a brand new copy.

Visita la pagina della libreria

Informazioni sull?azienda del venditore

J2B Holdings, LLC
13770 NOEL RD, #803600, Dallas, TX, 75240, U.S.A.

Condizioni di vendita:

We guarantee the condition of every book as it's described on the AbeBooks web
sites. Please note that used items may not include access codes or cards, CD's
or other accessories, regardless of what is stated in item title. If you need to
guarantee that these items are included, please purchase a brand new copy.

All requests for refunds and/or returns will be processed in accordance with
AbeBooks policies. If you're dissatisfied with your purchase (Incorrect Book/Not
as Described/Damaged) or if ...

Ulteriori informazioni

Condizioni di spedizione:

Books ordered via expedited shipping should arrive between 2 and 7 business days after shipment confirmation. Books ordered via standard shipping should arrive between 4 and 14 business days after shipment confirmation.

Metodi di pagamento
accettati dalla libreria

Aggiungi ai desiderata

Articoli correlati a Graph-Theoretic Concepts in Computer Science: 15th...

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, 411)

Nuovi - Brossura

Informazioni sull?azienda del venditore