Graph-theoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Lexicographic Breadth First Search – A Survey
3. Altmetric Badge
   Chapter 2 Wireless Networking: Graph Theory Unplugged
4. Altmetric Badge
   Chapter 3 Constant Time Generation of Trees with Specified Diameter
5. Altmetric Badge
   Chapter 4 Treelike Comparability Graphs: Characterization, Recognition, and Applications
6. Altmetric Badge
   Chapter 5 Elegant Distance Constrained Labelings of Trees
7. Altmetric Badge
   Chapter 6 Collective Tree Spanners and Routing in AT-free Related Graphs
8. Altmetric Badge
   Chapter 7 On the Maximum Cardinality Search Lower Bound for Treewidth
9. Altmetric Badge
   Chapter 8 Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs
10. Altmetric Badge
    Chapter 9 Recognizing HHD-free and Welsh-Powell Opposition Graphs
11. Altmetric Badge
    Chapter 10 Bimodular Decomposition of Bipartite Graphs
12. Altmetric Badge
    Chapter 11 Coloring a Graph Using Split Decomposition
13. Altmetric Badge
    Chapter 12 Decremental Clique Problem
14. Altmetric Badge
    Chapter 13 A Symbolic Approach to the All-Pairs Shortest-Paths Problem
15. Altmetric Badge
    Chapter 14 Minimal de Bruijn Sequence in a Language with Forbidden Substrings
16. Altmetric Badge
    Chapter 15 A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic $\mathcal{EL}$
17. Altmetric Badge
    Chapter 16 The Computational Complexity of the Minimum Weight Processor Assignment Problem
18. Altmetric Badge
    Chapter 17 A Stochastic Location Problem with Applications to Tele-diagnostic
19. Altmetric Badge
    Chapter 18 A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
20. Altmetric Badge
    Chapter 19 Tolerance Based Algorithms for the ATSP
21. Altmetric Badge
    Chapter 20 Finding k Disjoint Triangles in an Arbitrary Graph
22. Altmetric Badge
    Chapter 21 Exact (Exponential) Algorithms for the Dominating Set Problem
23. Altmetric Badge
    Chapter 22 Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps
24. Altmetric Badge
    Chapter 23 Planar Graphs, via Well-Orderly Maps and Trees
25. Altmetric Badge
    Chapter 24 Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs
26. Altmetric Badge
    Chapter 25 Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
27. Altmetric Badge
    Chapter 26 Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
28. Altmetric Badge
    Chapter 27 Octagonal Drawings of Plane Graphs with Prescribed Face Areas
29. Altmetric Badge
    Chapter 28 Crossing Reduction in Circular Layouts
30. Altmetric Badge
    Chapter 29 Characterization and Recognition of Generalized Clique-Helly Graphs
31. Altmetric Badge
    Chapter 30 Edge-Connectivity Augmentation and Network Matrices
32. Altmetric Badge
    Chapter 31 Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size
33. Altmetric Badge
    Chapter 32 The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small
34. Altmetric Badge
    Chapter 33 Core Stability of Minimum Coloring Games