Graphtheoretic concepts in computer science : proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980
Guardado en:
| Otros Autores: | |
|---|---|
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
100 |
| Materias: | |
| Acceso en línea: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Graphtheoretic concepts in computer science, proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980, edited by Hartmut Noltemeier, Berlin, Springer-Verlag, 1981, 1 vol. (X-403 p.), Lecture notes in computer science, 0-387-10291-4 • Graphtheoretic Concepts in Computer Science, Texte imprimé, 9783540102915 • Graphtheoretic Concepts in Computer Science, Texte imprimé, 9783662176504 |
Tabla de Contenidos:
- The post-office problem and related questions
- Series of graphs generated by rational machines
- On linearizing graphs
- Set-theoretic concepts in programming languages and their implementation
- Graph rewriting and automatic, machine-independent program optimization
- Properties of ordered graph grammars
- The power of a one-dimensional vector of processors
- A new data structure for representing sorted lists
- On the use of some almost sure graph properties
- On a generalization of heaps
- Graph grammars and the complexity gap in the isomorphism problem for acyclic digraphs
- Issues in the study of graph embeddings
- Schema hypergraphs:A formalism to investigate logical data base design
- The use of transitively irreducible kernels of full families of functional dependencies in logical data base design
- Graph algorithms for the synthesis and manipulation of data base schemes
- The analysis of search trees: A survey
- A framework for data structures
- Investigating programs in terms of partial graphs
- An observation concerning the complexity of problems with few solutions and its application to cryptography
- Bounding the bandwidth of NP-complete problems
- The complexity of path problems in graphs and path systems of bounded bandwidth
- A comparison between petri-nets and graph grammars
- A graph grammar representation of nonsequential processes
- Reachability homomorphisms on nets
- A birds eye view to path problems
- The chinese postman problem for mixed graphs
- Alternating cycle covers and paths
- Generating all planar 0-,1-,2-,3-connected graphs
- Optimal (s,t)-cuts
- F-factors, perfect matchings and related concepts.