Graph-theoretic concepts in computer science : [12th] International workshop WG'86, Bernried, Federal Republic of Germany, June 17-19, 1986 : proceedings
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...
Tallennettuna:
| Yhteisötekijä: | |
|---|---|
| Muut tekijät: | , |
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Sarja: | Lecture notes in computer science
246 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Graph-theoretic concepts in computer science, International workshop WG'86, Bernried, Federal Republic of Germany, June 17-19, 1986 Proceedings, ed. by Gottfried Tinhofer and Gunther Schmidt, Berlin, Springer, 1987, 1 vol. (VII-305 p.), Lecture notes in computer science, 3-540-17218-1 • Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662201831 |
Sisällysluettelo:
- 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.