Graph-Theoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Disjoint paths in the hypercube
3. Altmetric Badge
   Chapter 2 Time bounds for broadcasting in bounded degree graphs
4. Altmetric Badge
   Chapter 3 t/s -Diagnosable systems: A characterization and diagnosis algorithm
5. Altmetric Badge
   Chapter 4 Toward a complete representation of graphoids in graphs — Abridged Version
6. Altmetric Badge
   Chapter 5 CADULA — A graph-based model for monitoring CAD-processes
7. Altmetric Badge
   Chapter 6 On hyperedge replacement and BNLC graph grammars
8. Altmetric Badge
   Chapter 7 Graph rewriting systems with priorities
9. Altmetric Badge
   Chapter 8 Filtering hyperedge-replacement languages through compatible properties
10. Altmetric Badge
    Chapter 9 Describing distributed systems by categorical graph grammars
11. Altmetric Badge
    Chapter 10 A parser for context free plex grammars
12. Altmetric Badge
    Chapter 11 Introduction to PROGRESS, an attribute graph grammar based specification language
13. Altmetric Badge
    Chapter 12 On the complexity of optimal drawings of graphs
14. Altmetric Badge
    Chapter 13 Bounds to the page number of partially ordered sets
15. Altmetric Badge
    Chapter 14 Beyond Steiner's problem: A VLSI oriented generalization
16. Altmetric Badge
    Chapter 15 A fast sequential and parallel algorithm for the computation of the k-closure of a graph
17. Altmetric Badge
    Chapter 16 On feedback problems in digraphs
18. Altmetric Badge
    Chapter 17 Improved self-reduction algorithms for graphs with bounded treewidth
19. Altmetric Badge
    Chapter 18 Finding a minimal transitive reduction in a strongly connected digraph within linear time
20. Altmetric Badge
    Chapter 19 Paging binary trees with external balancing
21. Altmetric Badge
    Chapter 20 The complexity of graph problems for succinctly represented graphs
22. Altmetric Badge
    Chapter 21 An O ( n log n ) algorithm for 1-D tile compaction
23. Altmetric Badge
    Chapter 22 Weighted parallel triangulation of simple polygons
24. Altmetric Badge
    Chapter 23 Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry
25. Altmetric Badge
    Chapter 24 k — Nearest — Neighbor Voronoi diagrams for sets of convex polygons, line segments and points
26. Altmetric Badge
    Chapter 25 Finding squares and rectangles in sets of points
27. Altmetric Badge
    Chapter 26 Combinatorial properties of abstract Voronoi diagrams