↓ 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 Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces
  3. Altmetric Badge
    Chapter 2 Data Management in Networks
  4. Altmetric Badge
    Chapter 3 Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs
  5. Altmetric Badge
    Chapter 4 Approximate Constrained Bipartite Edge Coloring
  6. Altmetric Badge
    Chapter 5 Maximum Clique Transversals
  7. Altmetric Badge
    Chapter 6 On the Tree-Degree of Graphs
  8. Altmetric Badge
    Chapter 7 On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
  9. Altmetric Badge
    Chapter 8 ( k +) -Disatance- Herediatry Graphs
  10. Altmetric Badge
    Chapter 9 On the Relationship between Clique-Width and Treewidth
  11. Altmetric Badge
    Chapter 10 Planarity of the 2-Level Cactus Model
  12. Altmetric Badge
    Chapter 11 Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
  13. Altmetric Badge
    Chapter 12 How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
  14. Altmetric Badge
    Chapter 13 ( g, f )-Factorizations Orthogonal to k Subgraphs
  15. Altmetric Badge
    Chapter 14 On Star Coloring of Graphs
  16. Altmetric Badge
    Chapter 15 Graph Subcolorings: Complexity and Algorithms
  17. Altmetric Badge
    Chapter 16 Approximation of Pathwidth of Outerplanar Graphs
  18. Altmetric Badge
    Chapter 17 On the Monotonicity of Games Generated by Symmetric Submodular Functions
  19. Altmetric Badge
    Chapter 18 Multiple Hotlink Assignment
  20. Altmetric Badge
    Chapter 19 Small k -Dominating Sets in Planar Graphs with Applications
  21. Altmetric Badge
    Chapter 20 Lower Bounds for Algorithms for the Steiner Tree Problem
  22. Altmetric Badge
    Chapter 21 log n -Approximative NLC k -Decomposition in O ( n 2 k +1 ) Time
  23. Altmetric Badge
    Chapter 22 On Subfamilies of AT-Free Graphs
  24. Altmetric Badge
    Chapter 23 Complexity of Coloring Graphs without Forbidden Induced Subgraphs
  25. Altmetric Badge
    Chapter 24 On Stable Cutsets in Line Graphs
  26. Altmetric Badge
    Chapter 25 On Strong Menger-Connectivity of Star Graphs
  27. Altmetric Badge
    Chapter 26 The Complexity of the Matching-Cut Problem
  28. Altmetric Badge
    Chapter 27 De Bruijn Graphs and DNA Graphs
  29. Altmetric Badge
    Chapter 28 A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness
  30. Altmetric Badge
    Chapter 29 Critical and Anticritical Edges in Perfect Graphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
11 Wikipedia pages

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
13 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, September 2001
DOI 10.1007/3-540-45477-2
ISBNs
978-3-54-042707-0, 978-3-54-045477-9
Editors

Brandstädt, Andreas, Le, Van Bang

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Brazil 2 15%
United States 2 15%
Switzerland 1 8%
Italy 1 8%
Portugal 1 8%
Ukraine 1 8%
Germany 1 8%
Hong Kong 1 8%
Czechia 1 8%
Other 0 0%
Unknown 2 15%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 23 177%
Student > Master 16 123%
Researcher 11 85%
Professor 9 69%
Student > Bachelor 5 38%
Other 19 146%
Readers by discipline Count As %
Computer Science 47 362%
Mathematics 13 100%
Engineering 10 77%
Physics and Astronomy 4 31%
Unspecified 3 23%
Other 6 46%