Graph-Theoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 30 On improved time bounds for permutation graph problems
3. Altmetric Badge
   Chapter 31 A simple test for interval graphs
4. Altmetric Badge
   Chapter 32 Tolerance graphs and orders
5. Altmetric Badge
   Chapter 33 On scheduling problems restricted to interval orders
6. Altmetric Badge
   Chapter 34 Scheduling with incompatible jobs
7. Altmetric Badge
   Chapter 35 Generalized coloring for tree-like graphs
8. Altmetric Badge
   Chapter 36 Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes
9. Altmetric Badge
   Chapter 37 Topology of parallel networks and computational complexity (extended abstract)
10. Altmetric Badge
    Chapter 38 Parallel triangulation of nonconvex polytopes
11. Altmetric Badge
    Chapter 39 Kayles on special classes of graphs — An application of Sprague-Grundy theory
12. Altmetric Badge
    Chapter 40 A linear time algorithm for isomorphism of graphs of bounded average genus
13. Altmetric Badge
    Chapter 41 Improved algorithms for routing on two-dimensional grids
14. Altmetric Badge
    Chapter 42 Minimum rectilinear steiner trees for intervals on two parallel lines
15. Altmetric Badge
    Chapter 43 A new characterization of tree medians with applications to distributed algorithms
16. Altmetric Badge
    Chapter 44 The 3-edge-components and a structural description of all 3-edge-cuts in a graph
17. Altmetric Badge
    Chapter 45 On assembly of four-connected graphs
18. Altmetric Badge
    Chapter 46 On the homogeneous decomposition of graphs
19. Altmetric Badge
    Chapter 47 Embeddings in recursive combinatorial networks
20. Altmetric Badge
    Chapter 48 On shortcutting digraphs
21. Altmetric Badge
    Chapter 49 An efficient algorithm to recognize prime undirected graphs
22. Altmetric Badge
    Chapter 50 On the complexity of partial order properties
23. Altmetric Badge
    Chapter 51 Probabilistic graph grammars
24. Altmetric Badge
    Chapter 52 Single vs. double pushout derivations of graphs
25. Altmetric Badge
    Chapter 53 Hexagonal grid drawings
26. Altmetric Badge
    Chapter 54 Graph algorithms = iteration + data structures?
27. Altmetric Badge
    Chapter 55 Petri nets, hypergraphs and conflicts (preliminary version)
28. Altmetric Badge
    Chapter 56 Analysis and manipulation of Boolean functions in terms of decision graphs
29. Altmetric Badge
    Chapter 57 The expressiveness of silence: Tight bounds for synchronous communication of information using bits and silence
30. Altmetric Badge
    Chapter 58 The power and the limitations of local computations on graphs