Graph-Theoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Hypergraphs and decision trees
3. Altmetric Badge
   Chapter 2 Improved approximations of independent dominating set in bounded degree graphs
4. Altmetric Badge
   Chapter 3 A new characterization of P 4 -connected graphs
5. Altmetric Badge
   Chapter 4 Node rewriting in hypergraphs
6. Altmetric Badge
   Chapter 5 On κ-partitioning the n-cube
7. Altmetric Badge
   Chapter 6 Embedding complete binary trees in product graphs
8. Altmetric Badge
   Chapter 7 Clique and anticlique partitions of graphs
9. Altmetric Badge
   Chapter 8 Optimal parallel routing in star graphs
10. Altmetric Badge
    Chapter 9 Counting edges in a dag
11. Altmetric Badge
    Chapter 10 Closure properties of context-free Hyperedge Replacement Systems
12. Altmetric Badge
    Chapter 11 Upward drawings of search trees
13. Altmetric Badge
    Chapter 12 More general parallel tree contraction: Register allocation and broadcasting in a tree
14. Altmetric Badge
    Chapter 13 System diagnosis with smallest risk of error
15. Altmetric Badge
    Chapter 14 Efficient algorithms for shortest path queries in planar digraphs
16. Altmetric Badge
    Chapter 15 LexBFS-orderings and powers of graphs
17. Altmetric Badge
    Chapter 16 Efficient Union-Find for planar graphs and other sparse graph classes
18. Altmetric Badge
    Chapter 17 Switchbox routing in VLSI design: Closing the complexity gap
19. Altmetric Badge
    Chapter 18 Detecting diamond necklaces in labeled dags
20. Altmetric Badge
    Chapter 19 Algebraic graph derivations for graphical calculi
21. Altmetric Badge
    Chapter 20 Definability equals recognizability of partial 3-trees
22. Altmetric Badge
    Chapter 21 One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
23. Altmetric Badge
    Chapter 22 Approximate maxima finding of continuous functions under restricted budget (Extended abstract)
24. Altmetric Badge
    Chapter 23 The Optimal Cost Chromatic Partition problem for trees and interval graphs
25. Altmetric Badge
    Chapter 24 Modifying networks to obtain low cost trees
26. Altmetric Badge
    Chapter 25 On the hardness of allocating frequencies for hybrid networks
27. Altmetric Badge
    Chapter 26 Homogeneous sets and domination problems
28. Altmetric Badge
    Chapter 27 Independent spanning trees of product graphs
29. Altmetric Badge
    Chapter 28 Designing distrance-preserving fault-tolerant topologies
30. Altmetric Badge
    Chapter 29 Shortest path algorithms for nearly acyclic directed graphs
31. Altmetric Badge
    Chapter 30 Computing disjoint paths with length constraints
32. Altmetric Badge
    Chapter 31 Generalized edge-rankings of trees