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 |
Incremental FO ( +, < ) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions
|
---|---|
Chapter number | 23 |
Book title |
Database Theory — ICDT’99
|
Published by |
Springer, Berlin, Heidelberg, January 1999
|
DOI | 10.1007/3-540-49257-7_23 |
Book ISBNs |
978-3-54-065452-0, 978-3-54-049257-3
|
Authors |
Chaoyi Pang, Ramamohanarao Kotagiri, Guozhu Dong, Pang, Chaoyi, Kotagiri, Ramamohanarao, Dong, Guozhu |
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 % |
---|---|---|
United States | 1 | 50% |
Unknown | 1 | 50% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Other | 2 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 100% |