Fast computation of empirically tight bounds for the diameter of massive graphs

Clémence Magnien, Matthieu Latapy, Michel Habib

Open source

DOI: 10.1145/1412228.1455266
Published: 2009-02
Container: ACM Journal of Experimental Algorithmics
Publisher: Association for Computing Machinery (ACM)
Open access: unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1145/1412228.1455266,
  title = {Fast computation of empirically tight bounds for the diameter of massive graphs},
  author = {Clémence Magnien and Matthieu Latapy and Michel Habib},
  year = {2009},
  journal = {ACM Journal of Experimental Algorithmics},
  doi = {10.1145/1412228.1455266},
  url = {https://doi.org/10.1145/1412228.1455266}
}

RIS

TY  - JOUR
TI  - Fast computation of empirically tight bounds for the diameter of massive graphs
AU  - Clémence Magnien
AU  - Matthieu Latapy
AU  - Michel Habib
PY  - 2009
JO  - ACM Journal of Experimental Algorithmics
DO  - 10.1145/1412228.1455266
UR  - https://doi.org/10.1145/1412228.1455266
ER  -

APA

Magnien, C., Latapy, M., & Habib, M. (2009). Fast computation of empirically tight bounds for the diameter of massive graphs. ACM Journal of Experimental Algorithmics. https://doi.org/10.1145/1412228.1455266

Source records

crossref · retrieved 2026-11-10T21:30:28.332Z