Skip to content
Free planNo credit card requiredStart writing

book chapter · 2004

Randomized Graph Data-Structures for Approximate Shortest Paths

Cited by 0Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

APA 7

(2004). Randomized Graph Data-Structures for Approximate Shortest Paths. https://doi.org/10.1201/9781420035179-50

MLA 9

“Randomized Graph Data-Structures for Approximate Shortest Paths.” 2004, pp. 813–32, https://doi.org/10.1201/9781420035179-50.

Chicago

2004. “Randomized Graph Data-Structures for Approximate Shortest Paths.” https://doi.org/10.1201/9781420035179-50.

Harvard

(2004) ‘Randomized Graph Data-Structures for Approximate Shortest Paths’. Available at: https://doi.org/10.1201/9781420035179-50.

BibTeX
@incollection{anon2004randomized,
  title = {{Randomized Graph Data-Structures for Approximate Shortest Paths}},
  pages = {813--832},
  year = {2004},
  doi = {10.1201/9781420035179-50}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.