Graphtheoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 The post-office problem and related questions
3. Altmetric Badge
   Chapter 2 Series of graphs generated by rational machines
4. Altmetric Badge
   Chapter 3 On linearizing graphs
5. Altmetric Badge
   Chapter 4 Set-theoretic concepts in programming languages and their implementation
6. Altmetric Badge
   Chapter 5 Graph rewriting and automatic, machine-independent program optimization
7. Altmetric Badge
   Chapter 6 Properties of ordered graph grammars
8. Altmetric Badge
   Chapter 7 The power of a one-dimensional vector of processors
9. Altmetric Badge
   Chapter 8 A new data structure for representing sorted lists
10. Altmetric Badge
    Chapter 9 On the use of some almost sure graph properties
11. Altmetric Badge
    Chapter 10 On a generalization of heaps
12. Altmetric Badge
    Chapter 11 Graph grammars and the complexity gap in the isomorphism problem for acyclic digraphs
13. Altmetric Badge
    Chapter 12 Issues in the study of graph embeddings
14. Altmetric Badge
    Chapter 13 Schema hypergraphs:A formalism to investigate logical data base design
15. Altmetric Badge
    Chapter 14 The use of transitively irreducible kernels of full families of functional dependencies in logical data base design
16. Altmetric Badge
    Chapter 15 Graph algorithms for the synthesis and manipulation of data base schemes
17. Altmetric Badge
    Chapter 16 The analysis of search trees: A survey
18. Altmetric Badge
    Chapter 17 A framework for data structures
19. Altmetric Badge
    Chapter 18 Investigating programs in terms of partial graphs
20. Altmetric Badge
    Chapter 19 An observation concerning the complexity of problems with few solutions and its application to cryptography
21. Altmetric Badge
    Chapter 20 Bounding the bandwidth of NP-complete problems
22. Altmetric Badge
    Chapter 21 The complexity of path problems in graphs and path systems of bounded bandwidth
23. Altmetric Badge
    Chapter 22 A comparison between petri-nets and graph grammars
24. Altmetric Badge
    Chapter 23 A graph grammar representation of nonsequential processes
25. Altmetric Badge
    Chapter 24 Reachability homomorphisms on nets
26. Altmetric Badge
    Chapter 25 A birds eye view to path problems
27. Altmetric Badge
    Chapter 26 The chinese postman problem for mixed graphs
28. Altmetric Badge
    Chapter 27 Alternating cycle covers and paths
29. Altmetric Badge
    Chapter 28 Generating all planar 0-,1-,2-,3-connected graphs
30. Altmetric Badge
    Chapter 29 Optimal (s,t)-cuts
31. Altmetric Badge
    Chapter 30 F-factors, perfect matchings and related concepts