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.
Mendeley readers
Chapter title |
Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs
|
---|---|
Chapter number | 38 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 2005
|
DOI | 10.1007/11604686_38 |
Book ISBNs |
978-3-54-031000-6, 978-3-54-031468-4
|
Authors |
Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara, Okamoto, Yoshio, Uno, Takeaki, Uehara, Ryuhei |
Mendeley readers
The data shown below were compiled from readership statistics for 15 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 1 | 7% |
Unknown | 14 | 93% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 5 | 33% |
Student > Master | 4 | 27% |
Student > Ph. D. Student | 3 | 20% |
Lecturer | 1 | 7% |
Researcher | 1 | 7% |
Other | 1 | 7% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 10 | 67% |
Mathematics | 3 | 20% |
Agricultural and Biological Sciences | 1 | 7% |
Engineering | 1 | 7% |