↓ Skip to main content
What is this page? Embed badge

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 Graph-Theoretic Solutions to Computational Geometry Problems
  3. Altmetric Badge
    Chapter 2 Algorithms for Classes of Graphs with Bounded Expansion
  4. Altmetric Badge
    Chapter 3 A Graph Polynomial Arising from Community Structure (Extended Abstract)
  5. Altmetric Badge
    Chapter 4 Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
  6. Altmetric Badge
    Chapter 5 Maximum Series-Parallel Subgraph
  7. Altmetric Badge
    Chapter 6 Low-Port Tree Representations
  8. Altmetric Badge
    Chapter 7 Fully Dynamic Representations of Interval Graphs
  9. Altmetric Badge
    Chapter 8 The Parameterized Complexity of Some Minimum Label Problems
  10. Altmetric Badge
    Chapter 9 Exact and Parameterized Algorithms for Max Internal Spanning Tree
  11. Altmetric Badge
    Chapter 10 An Exact Algorithm for Minimum Distortion Embedding
  12. Altmetric Badge
    Chapter 11 Sub-coloring and Hypo-coloring Interval Graphs
  13. Altmetric Badge
    Chapter 12 Parameterized Complexity of Generalized Domination Problems
  14. Altmetric Badge
    Chapter 13 Connected Feedback Vertex Set in Planar Graphs
  15. Altmetric Badge
    Chapter 14 Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)
  16. Altmetric Badge
    Chapter 15 On Module-Composed Graphs
  17. Altmetric Badge
    Chapter 16 An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
  18. Altmetric Badge
    Chapter 17 The k-Disjoint Paths Problem on Chordal Graphs
  19. Altmetric Badge
    Chapter 18 Local Algorithms for Edge Colorings in UDGs
  20. Altmetric Badge
    Chapter 19 Directed Rank-Width and Displit Decomposition
  21. Altmetric Badge
    Chapter 20 An Algorithmic Study of Switch Graphs
  22. Altmetric Badge
    Chapter 21 Hardness Results and Efficient Algorithms for Graph Powers
  23. Altmetric Badge
    Chapter 22 Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph
  24. Altmetric Badge
    Chapter 23 Injective Oriented Colourings
  25. Altmetric Badge
    Chapter 24 Chordal Digraphs
  26. Altmetric Badge
    Chapter 25 A New Intersection Model and Improved Algorithms for Tolerance Graphs
  27. Altmetric Badge
    Chapter 26 Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
  28. Altmetric Badge
    Chapter 27 Distance d -Domination Games
  29. Altmetric Badge
    Chapter 28 Cycles, Paths, Connectivity and Diameter in Distance Graphs
  30. Altmetric Badge
    Chapter 29 Smallest Odd Holes in Claw-Free Graphs (Extended Abstract)
  31. Altmetric Badge
    Chapter 30 Finding Induced Paths of Given Parity in Claw-Free Graphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
6 Wikipedia pages

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
3 Mendeley
Summary Wikipedia Dimensions citations
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, December 2009
DOI 10.1007/978-3-642-11409-0
ISBNs
978-3-64-211408-3, 978-3-64-211409-0
Editors

Paul, Christophe, Habib, Michel

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Japan 1 33%
Unknown 2 67%

Demographic breakdown

Readers by professional status Count As %
Student > Master 1 33%
Student > Doctoral Student 1 33%
Researcher 1 33%
Readers by discipline Count As %
Computer Science 3 100%

This page is provided by Altmetric.