Cantitate/Preț
Produs
Total produse
Vezi coșul
Graph-Theoretic Concepts in Computer Science de Herbert Göttler

Graph-Theoretic Concepts in Computer Science

Editat de Herbert Göttler, Hans-Jürgen Schneider
en Limba Engleză Paperback – 8 iun 1988
This book reflects the scientific program of the annual workshop on Graph-theoretic Concepts in Computer Science in 1987. The purpose of this conference is to be the "missing link" between theory and application of graphs in as many branches of computer science as a conference scheduled for three days without parallel sessions can permit. So the organizers of WG '87 addressed a selected group of people with a strong interest in theory and practice. The proceedings include latest results on "classical" graph-theoretic problems (including formal language theory applied to graphs) and how to apply those results to practical problems, e.g. data bases, layout of graph operating systems, software engineering, chemistry, and modelling with graphs.
Citește tot Restrânge

Preț: 32032 lei

Preț vechi: 40041 lei
-20%

Puncte Express: 480

Carte tipărită la comandă

Livrare economică 09-23 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540194224
ISBN-10: 3540194223
Pagini: 264
Ilustrații: VIII, 256 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:1988
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Distributed parallelism of graph transformations.- A PrT-net representation of graph grammars.- Pretty patterns produced by hyperedge replacement.- Graph languages defined by systems of forbidden structures: A survey.- A sweepcircle algorithm for Voronoi diagrams.- Competitive location in the L1 and Linf metrics.- Priority search trees in secondary memory (extended abstract).- On the analysis of grid structures for spatial objects of non-zero size.- Maintenance of transitive closures and transitive reductions of graphs.- Upward drawings of acyclic digraphs.- Approximate counting, uniform generation and rapidly mixing markov chains extended abstract.- On chaotic behaviour of some np-complete problems.- External labeling and algorithms for hierarchic networks.- Designing gamma-acyclic database schemes using decomposition and augmentation techniques.- Graph-theoretical tools and their use in a practical distributed operating system design case.- Development of several reachability algorithms for directed graphs.- On integration mechanisms within a graph-based software development environment.- Restructuring aspect graphs into aspect- and cell-equivalence classes for use in computer vision.- Automatic crystal chemical classification of silicates using direction-labeled graphs.