↓ Skip to main content

Graph-Theoretic Concepts in Computer Science

Overview of attention for book
Cover of 'Graph-Theoretic Concepts in Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Sequences of Radius k for Complete Bipartite Graphs
  3. Altmetric Badge
    Chapter 2 Approximate Association via Dissociation
  4. Altmetric Badge
    Chapter 3 Geodetic Convexity Parameters for Graphs with Few Short Induced Paths
  5. Altmetric Badge
    Chapter 4 Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs
  6. Altmetric Badge
    Chapter 5 Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results
  7. Altmetric Badge
    Chapter 6 Finding Two Edge-Disjoint Paths with Length Constraints
  8. Altmetric Badge
    Chapter 7 Packing and Covering Immersion Models of Planar Subcubic Graphs
  9. Altmetric Badge
    Chapter 8 The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs
  10. Altmetric Badge
    Chapter 9 Parameterized Power Vertex Cover
  11. Altmetric Badge
    Chapter 10 Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
  12. Altmetric Badge
    Chapter 11 Induced Separation Dimension
  13. Altmetric Badge
    Chapter 12 Tight Bounds for Gomory-Hu-like Cut Counting
  14. Altmetric Badge
    Chapter 13 Eccentricity Approximating Trees
  15. Altmetric Badge
    Chapter 14 Drawing Planar Graphs with Prescribed Face Areas
  16. Altmetric Badge
    Chapter 15 Vertex Cover Structural Parameterization Revisited
  17. Altmetric Badge
    Chapter 16 On Distance- d Independent Set and Other Problems in Graphs with “few” Minimal Separators
  18. Altmetric Badge
    Chapter 17 Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability
  19. Altmetric Badge
    Chapter 18 On Edge Intersection Graphs of Paths with 2 Bends
  20. Altmetric Badge
    Chapter 19 Almost Induced Matching: Linear Kernels and Parameterized Algorithms
  21. Altmetric Badge
    Chapter 20 Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property
  22. Altmetric Badge
    Chapter 21 Harmonious Coloring: Parameterized Algorithms and Upper Bounds
  23. Altmetric Badge
    Chapter 22 On Directed Steiner Trees with Multiple Roots
  24. Altmetric Badge
    Chapter 23 A Faster Parameterized Algorithm for Group Feedback Edge Set
  25. Altmetric Badge
    Chapter 24 Sequence Hypergraphs
  26. Altmetric Badge
    Chapter 25 On Subgraphs of Bounded Degeneracy in Hypergraphs
  27. Altmetric Badge
    Chapter 26 Erratum to: Packing and Covering Immersion Models of Planar Subcubic Graphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Graph-Theoretic Concepts in Computer Science
Published by
Springer Berlin Heidelberg, September 2016
DOI 10.1007/978-3-662-53536-3
ISBNs
978-3-66-253535-6, 978-3-66-253536-3
Editors

Heggernes, Pinar

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Computer Science 1 100%