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 Efficient DFS Algorithm to Compute Least Longest Schedule Path of Software Projects
|
---|---|
Chapter number | 42 |
Book title |
Inventive Communication and Computational Technologies
|
Published by |
Springer, Singapore, January 2021
|
DOI | 10.1007/978-981-15-7345-3_42 |
Book ISBNs |
978-9-81-157344-6, 978-9-81-157345-3
|
Authors |
B. N. Arunakumari, Arunakumari, B. N. |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Other | 1 | 50% |
Student > Master | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 50% |
Engineering | 1 | 50% |