Cantitate/Preț
Produs
Total produse
Vezi coșul
Graph-Theoretic Concepts in Computer Science de Gottfried Tinhofer

Graph-Theoretic Concepts in Computer Science

Editat de Gottfried Tinhofer, Gunther Schmidt
en Limba Engleză Paperback – 8 apr 1987
Graph-theoretic concepts are developed by computer scientists in order to model algorithms, nets, rewriting systems, distributed systems, parallelism, geometric and layout concepts. Their complexity is studied under various randomness assumptions. This volume contains contributions to the twelfth of a series of annual workshops designed to bring together researchers using graph-theoretic methods. Its purpose is to broadcast emerging new developments from and to a diversity of application fields. The topics covered include: Graph Grammars, Graph Manipulation, Nets, Complexity Issues, Algorithmic and Network Considerations, Outerplanar Graphs, Graph Isomorphism, Parallelism and Distributed Systems, Graphs and Geometry, Randomness Considerations, Applications in Chemistry, Specific Algorithms. N
Citește tot Restrânge

Preț: 32339 lei

Preț vechi: 40423 lei
-20%

Puncte Express: 485

Carte tipărită la comandă

Livrare economică 11-25 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: 9783540172185
ISBN-10: 3540172181
Pagini: 324
Ilustrații: X, 314 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:1987
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

A simple linear-time algorithm to recognize interval graphs.- On approximation algorithms for Steiner's problem in graphs.- Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity.- ADA concurrency specified by graph grammars.- Cabri, an interactive system for graph manipulation.- An interactive graphical manipulation system for higher objects based on relational algebra.- Behaviour preserving refinements of Petri nets.- The bandwidth of planar distributive lattices.- The node visit cost of brother trees.- Searching connected components in very large grid graphs.- A simple implementation of Warshall's algorithm on a vlsi chip.- On some generalizations of outerplanar graphs: Results and open problems.- Recognizing outerplanar graphs in linear time.- Graphs and graph polynomials of interest in chemistry.- Applications of parallel scheduling to perfect graphs.- A graph-theoretic approach for designing fair distributed resource schedulingalgorithms.- Improved diameter bounds for altered graphs.- Separability of sets of polygons.- Centipede graphs and visibility on a cylinder.- The diameter of connected components of random graphs.- An algorithm for testing planarity of hierarchical graphs.- EDM — A data model for electronic CAD/CAM-applications.