Graph-Theoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs
3. Altmetric Badge
   Chapter 2 Recognizing Bipartite Tolerance Graphs in Linear Time
4. Altmetric Badge
   Chapter 3 Graph Searching in a Crime Wave
5. Altmetric Badge
   Chapter 4 Monotonicity of Non-deterministic Graph Searching
6. Altmetric Badge
   Chapter 5 Tree-Width and Optimization in Bounded Degree Graphs
7. Altmetric Badge
   Chapter 6 On Restrictions of Balanced 2-Interval Graphs
8. Altmetric Badge
   Chapter 7 Graph Operations Characterizing Rank-Width and Balanced Graph Expressions
9. Altmetric Badge
   Chapter 8 The Clique-Width of Tree-Power and Leaf-Power Graphs
10. Altmetric Badge
    Chapter 9 NLC-2 Graph Recognition and Isomorphism
11. Altmetric Badge
    Chapter 10 A Characterisation of the Minimal Triangulations of Permutation Graphs
12. Altmetric Badge
    Chapter 11 The 3-Steiner Root Problem
13. Altmetric Badge
    Chapter 12 On Finding Graph Clusterings with Maximum Modularity
14. Altmetric Badge
    Chapter 13 On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs
15. Altmetric Badge
    Chapter 14 A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs
16. Altmetric Badge
    Chapter 15 Approximation Algorithms for Geometric Intersection Graphs
17. Altmetric Badge
    Chapter 16 An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
18. Altmetric Badge
    Chapter 17 Mixing 3-Colourings in Bipartite Graphs
19. Altmetric Badge
    Chapter 18 Minimum-Weight Cycle Covers and Their Approximability
20. Altmetric Badge
    Chapter 19 On the Number of α -Orientations
21. Altmetric Badge
    Chapter 20 Complexity and Approximation Results for the Connected Vertex Cover Problem
22. Altmetric Badge
    Chapter 21 Segmenting Strings Homogeneously Via Trees
23. Altmetric Badge
    Chapter 22 Characterisations and Linear-Time Recognition of Probe Cographs
24. Altmetric Badge
    Chapter 23 Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
25. Altmetric Badge
    Chapter 24 Proper Helly Circular-Arc Graphs
26. Altmetric Badge
    Chapter 25 Pathwidth of Circular-Arc Graphs
27. Altmetric Badge
    Chapter 26 Characterization and Recognition of Digraphs of Bounded Kelly-width
28. Altmetric Badge
    Chapter 27 How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
29. Altmetric Badge
    Chapter 28 Obtaining a Planar Graph by Vertex Deletion
30. Altmetric Badge
    Chapter 29 Mixed Search Number and Linear-Width of Interval and Split Graphs
31. Altmetric Badge
    Chapter 30 Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
32. Altmetric Badge
    Chapter 31 The Complexity of Bottleneck Labeled Graph Problems