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 |
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
|
---|---|
Chapter number | 36 |
Book title |
Combinatorial Algorithms
|
Published in |
ADS, June 2009
|
DOI | 10.1007/978-3-642-10217-2_36 |
Book ISBNs |
978-3-64-210216-5, 978-3-64-210217-2
|
Authors |
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios, Lappas, Evaggelos, Nikolopoulos, Stavros D., Palios, Leonidas |
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 % |
---|---|---|
Professor > Associate Professor | 1 | 100% |
Lecturer | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 100% |
Agricultural and Biological Sciences | 1 | 100% |