Graph-Theoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 61 VC-dimensions for graphs (extended abstract)
3. Altmetric Badge
   Chapter 62 Finding and counting small induced subgraphs efficiently
4. Altmetric Badge
   Chapter 63 On the isomorphism of graphs with few P 4 s
5. Altmetric Badge
   Chapter 64 A dynamic algorithm for line graph recognition
6. Altmetric Badge
   Chapter 65 Incremental hive graph
7. Altmetric Badge
   Chapter 66 Planarization of graphs embedded on surfaces
8. Altmetric Badge
   Chapter 67 Complexity and approximability of certain bicriteria location problems
9. Altmetric Badge
   Chapter 68 On termination of graph rewriting
10. Altmetric Badge
    Chapter 69 A uniform approach to graph rewriting: The pullback approach
11. Altmetric Badge
    Chapter 70 Visualizing two- and three-dimensional models of meristematic growth
12. Altmetric Badge
    Chapter 71 Graph-theoretical methods to construct entity-relationship databases
13. Altmetric Badge
    Chapter 72 An approximation algorithm for 3-Colourability
14. Altmetric Badge
    Chapter 73 The malleability of TSP 2Opt
15. Altmetric Badge
    Chapter 74 Non-oblivious local search for graph and hypergraph coloring problems
16. Altmetric Badge
    Chapter 75 On Interval Routing Schemes and treewidth
17. Altmetric Badge
    Chapter 76 Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs
18. Altmetric Badge
    Chapter 77 Hot-potato routing on multi-dimensional tori
19. Altmetric Badge
    Chapter 78 On devising Boolean Routing schemes
20. Altmetric Badge
    Chapter 79 Toward a general theory of unicast-based multicast communication
21. Altmetric Badge
    Chapter 80 Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes
22. Altmetric Badge
    Chapter 81 Searching for faulty leaves in binary trees
23. Altmetric Badge
    Chapter 82 NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems
24. Altmetric Badge
    Chapter 83 Efficient parallel modular decomposition (extended abstract)
25. Altmetric Badge
    Chapter 84 Modular decomposition of hypergraphs
26. Altmetric Badge
    Chapter 85 Partition coefficients of acyclic graphs
27. Altmetric Badge
    Chapter 86 Sub-cubic cost algorithms for the all pairs shortest path problem
28. Altmetric Badge
    Chapter 87 Diametral path graphs
29. Altmetric Badge
    Chapter 88 Chordal graphs and their clique graphs
30. Altmetric Badge
    Chapter 89 A compact data structure and parallel algorithms for permutation graphs
31. Altmetric Badge
    Chapter 90 Homogeneously orderable graphs and the Steiner tree problem