Graph-Theoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Hypertree Decompositions: Structure, Algorithms, and Applications
3. Altmetric Badge
   Chapter 2 Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey
4. Altmetric Badge
   Chapter 3 Domination Search on Graphs with Low Dominating-Target-Number
5. Altmetric Badge
   Chapter 4 Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
6. Altmetric Badge
   Chapter 5 Approximating Rank-Width and Clique-Width Quickly
7. Altmetric Badge
   Chapter 6 Computing the Tutte Polynomial on Graphs of Bounded Clique-Width
8. Altmetric Badge
   Chapter 7 Minimizing NLC-Width is NP-Complete
9. Altmetric Badge
   Chapter 8 Channel Assignment and Improper Choosability of Graphs
10. Altmetric Badge
    Chapter 9 Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time
11. Altmetric Badge
    Chapter 10 Roman Domination over Some Graph Classes
12. Altmetric Badge
    Chapter 11 Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms
13. Altmetric Badge
    Chapter 12 Network Discovery and Verification
14. Altmetric Badge
    Chapter 13 Complete Graph Drawings Up to Triangle Mutations
15. Altmetric Badge
    Chapter 14 Collective Tree 1-Spanners for Interval Graphs
16. Altmetric Badge
    Chapter 15 On Stable Cutsets in Claw-Free Graphs and Planar Graphs
17. Altmetric Badge
    Chapter 16 Induced Subgraphs of Bounded Degree and Bounded Treewidth
18. Altmetric Badge
    Chapter 17 Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
19. Altmetric Badge
    Chapter 18 Ultimate Generalizations of LexBFS and LEX M
20. Altmetric Badge
    Chapter 19 Adding an Edge in a Cograph
21. Altmetric Badge
    Chapter 20 The Computational Complexity of Delay Management
22. Altmetric Badge
    Chapter 21 Acyclic Choosability of Graphs with Small Maximum Degree
23. Altmetric Badge
    Chapter 22 Generating Colored Trees
24. Altmetric Badge
    Chapter 23 Optimal Hypergraph Tree-Realization
25. Altmetric Badge
    Chapter 24 Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints
26. Altmetric Badge
    Chapter 25 On the Fixed-Parameter Enumerability of Cluster Editing
27. Altmetric Badge
    Chapter 26 Locally Consistent Constraint Satisfaction Problems with Binary Constraints
28. Altmetric Badge
    Chapter 27 On Randomized Broadcasting in Star Graphs
29. Altmetric Badge
    Chapter 28 Finding Disjoint Paths on Directed Acyclic Graphs
30. Altmetric Badge
    Chapter 29 Approximation Algorithms for the Bi-criteria Weighted max-cut Problem
31. Altmetric Badge
    Chapter 30 Approximation Algorithms for the Weighted Independent Set Problem
32. Altmetric Badge
    Chapter 31 Approximation Algorithms for Unit Disk Graphs
33. Altmetric Badge
    Chapter 32 Computation of Chromatic Polynomials Using Triangulations and Clique Trees
34. Altmetric Badge
    Chapter 33 Computing Branchwidth Via Efficient Triangulations and Blocks
35. Altmetric Badge
    Chapter 34 Algorithms Based on the Treewidth of Sparse Graphs
36. Altmetric Badge
    Chapter 35 Extending the Tractability Border for Closest Leaf Powers
37. Altmetric Badge
    Chapter 36 Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model
38. Altmetric Badge
    Chapter 37 Algebraic Operations on PQ Trees and Modular Decomposition Trees
39. Altmetric Badge
    Chapter 38 Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs
40. Altmetric Badge
    Chapter 39 Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny
41. Altmetric Badge
    Chapter 40 Recognizing HHDS-Free Graphs