↓ 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 27 Optimal parallel algorithms for sparse graphs
  3. Altmetric Badge
    Chapter 28 Finding minimally weighted subgraphs
  4. Altmetric Badge
    Chapter 29 On the complexity of some coloring games
  5. Altmetric Badge
    Chapter 30 A generalized best-first search method in graphs
  6. Altmetric Badge
    Chapter 31 Avoiding matrix multiplication
  7. Altmetric Badge
    Chapter 32 Induced subraph isomorphism for cographs is NP-complete
  8. Altmetric Badge
    Chapter 33 On feedback problems in planar digraphs
  9. Altmetric Badge
    Chapter 34 Recognizing binary hamming graphs in O ( n 2 log n ) time
  10. Altmetric Badge
    Chapter 35 Vertex-disjoint trees and boundary single-layer routing
  11. Altmetric Badge
    Chapter 36 Bounds on the quality of approximate solutions to the group Steiner problem
  12. Altmetric Badge
    Chapter 37 Two polynomial problems in PLA folding
  13. Altmetric Badge
    Chapter 38 The VLSI layout problem in various embedding models
  14. Altmetric Badge
    Chapter 39 Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems
  15. Altmetric Badge
    Chapter 40 Deterministic message routing in faulty hypercubes
  16. Altmetric Badge
    Chapter 41 On complexity of a message-routing strategy for multicomputer systems
  17. Altmetric Badge
    Chapter 42 Embeddings of treelike graphs into 2-dimensional meshes
  18. Altmetric Badge
    Chapter 43 Diagnosis of t/s-diagnosable systems
  19. Altmetric Badge
    Chapter 44 Deciding 1-solvability of distributed task is NP-hard
  20. Altmetric Badge
    Chapter 45 Remarks on some concurrency measures
  21. Altmetric Badge
    Chapter 46 On the rectilinear art gallery problem algorithmic aspects
  22. Altmetric Badge
    Chapter 47 Separation problems and circular arc systems
  23. Altmetric Badge
    Chapter 48 Genus of orders and lattices
  24. Altmetric Badge
    Chapter 49 Comparing the expressibility of two languages formed using NP-complete graph operators
  25. Altmetric Badge
    Chapter 50 Decomposition of linear recursive logic programs
  26. Altmetric Badge
    Chapter 51 On the transition graphs of automata and grammars
  27. Altmetric Badge
    Chapter 52 Algebraic approach to graph transformation based on single pushout derivations
Attention for Chapter 29: On the complexity of some coloring games
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
17 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.
Chapter title
On the complexity of some coloring games
Chapter number 29
Book title
Graph-Theoretic Concepts in Computer Science
Published in
Lecture notes in computer science, June 1990
DOI 10.1007/3-540-53832-1_29
Book ISBNs
978-3-54-053832-5, 978-3-54-046310-8
Authors

Hans L. Bodlaender, Bodlaender, Hans L.

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Switzerland 1 6%
Unknown 16 94%

Demographic breakdown

Readers by professional status Count As %
Student > Master 5 29%
Student > Ph. D. Student 3 18%
Professor 2 12%
Student > Bachelor 1 6%
Lecturer 1 6%
Other 2 12%
Unknown 3 18%
Readers by discipline Count As %
Computer Science 14 82%
Unknown 3 18%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 25 January 2019.
All research outputs
#7,455,523
of 22,792,160 outputs
Outputs from Lecture notes in computer science
#2,487
of 8,127 outputs
Outputs of similar age
#4,420
of 15,551 outputs
Outputs of similar age from Lecture notes in computer science
#2
of 4 outputs
Altmetric has tracked 22,792,160 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,127 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 55% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 15,551 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 8th percentile – i.e., 8% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 4 others from the same source and published within six weeks on either side of this one. This one has scored higher than 2 of them.