A fast method to exactly calculate the diameter of incremental disconnected graphs.
Masoud Sagharichian|Morteza Alipour Langouri|Hassan Naderi
| Anthology ID: | DBLP:journals/www/SagharichianLN17 |
|---|---|
| Year: | 2017 |
| Venue: | World Wide Web (WWW) |
| Pages: | 399-416 |
| URL: | https://doi.org/10.1007/S11280-016-0394-0 |
| DOI: | https://doi.org/10.1007/S11280-016-0394-0 |
| DBLP: | journals/www/SagharichianLN17 |
| BibTeX: |
@article{sagharichian-2017-fast,
author = {Masoud Sagharichian and
Morteza Alipour Langouri and
Hassan Naderi},
title = {{A fast method to exactly calculate the diameter of incremental disconnected graphs}},
journal = {World Wide Web (WWW)},
volume = {20},
number = {2},
pages = {399--416},
year = {2017},
url = {https://doi.org/10.1007/S11280-016-0394-0},
doi = {https://doi.org/10.1007/S11280-016-0394-0}
}