Graph-Theoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Approximating treewidth, pathwidth, and minimum elimination tree height
3. Altmetric Badge
   Chapter 2 Monadic second-order evaluations on tree-decomposable graphs
4. Altmetric Badge
   Chapter 3 Optimal embedding of complete binary trees into lines and grids
5. Altmetric Badge
   Chapter 4 Graph rewriting systems and their application to network reliability analysis
6. Altmetric Badge
   Chapter 5 Nondeterministic control structures for graph rewriting systems
7. Altmetric Badge
   Chapter 6 A language for generic graph-transformations
8. Altmetric Badge
   Chapter 7 Attributed elementary programmed graph grammars
9. Altmetric Badge
   Chapter 8 The complexity of approximating the class Steiner tree problem
10. Altmetric Badge
    Chapter 9 On complexity of some chain and antichain partition problems
11. Altmetric Badge
    Chapter 10 Tight bounds for the rectangular art gallery problem
12. Altmetric Badge
    Chapter 11 Voronoi diagrams of moving points in the plane
13. Altmetric Badge
    Chapter 12 Using maximal independent sets to solve problems in parallel
14. Altmetric Badge
    Chapter 13 Fast parallel algorithms for coloring random graphs
15. Altmetric Badge
    Chapter 14 Optimal vertex ordering of a graph and its application to symmetry detection
16. Altmetric Badge
    Chapter 15 Edge separators for graphs of bounded genus with applications
17. Altmetric Badge
    Chapter 16 Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing
18. Altmetric Badge
    Chapter 17 A generalized encryption scheme based on random graphs
19. Altmetric Badge
    Chapter 18 Dynamic algorithms for shortest paths in planar graphs
20. Altmetric Badge
    Chapter 19 Complete problems for logspace involving lexicographic first paths in graphs
21. Altmetric Badge
    Chapter 20 A new upper bound on the complexity of the all pairs shortest path problem
22. Altmetric Badge
    Chapter 21 On the crossing number of the hypercube and the cube connected cycles
23. Altmetric Badge
    Chapter 22 Logic arrays for interval indicator functions
24. Altmetric Badge
    Chapter 23 On the broadcast time of the butterfly network
25. Altmetric Badge
    Chapter 24 On disjoint cycles
26. Altmetric Badge
    Chapter 25 Short disjoint cycles in cubic bridgeless graphs