Home › Entities › doctoral_thesis › New Algorithm and Data Structures for the All Pairs Shortest Path Problem

New Algorithm and Data Structures for the All Pairs Shortest Path Problem

2013 doctoral thesis by Mashitoh Hashim at University of Canterbury
Place doctoral_thesis Q112903441
Press Enter · cited answer in seconds

New Algorithm and Data Structures for the All Pairs Shortest Path Problem

Summary

New Algorithm and Data Structures for the All Pairs Shortest Path Problem is a doctoral thesis[1].

Key Facts

  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's instance of is recorded as doctoral thesis[2].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem was published by UC Research Repository[3].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's language of work or name is recorded as English[4].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's country of origin is recorded as New Zealand[5].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem was published on 2013[6].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's main subject is all-pairs shortest path problem[7].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's main subject is algorithm[8].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's work available at URL is recorded as https://ir.canterbury.ac.nz/handle/10092/8196[9].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's title is recorded as New Algorithm and Data Structures for the All Pairs Shortest Path Problem[10].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's author name string is recorded as Mashitoh Hashim[11].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's thesis submitted to is recorded as University of Canterbury[12].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's on focus list of Wikimedia project is recorded as NZThesisProject[13].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's copyright status is recorded as copyrighted[14].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's online access status is recorded as open access[15].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's thesis committee member is recorded as Tadao Takaoka[16].
  • New Algorithm and Data Structures for the All Pairs Shortest Path Problem's thesis submitted for degree is recorded as Doctor of Philosophy[17].

Body

Designation and Status

New Algorithm and Data Structures for the All Pairs Shortest Path Problem's instance of is recorded as doctoral thesis[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.
  2. [3] ↑ . wikidata.org.
  3. [4] ↑ . wikidata.org.
  4. [5] ↑ . wikidata.org.
  5. [6] ↑ . wikidata.org.
  6. [7] ↑ . wikidata.org.
  7. [8] ↑ . wikidata.org.
  8. [9] ↑ . wikidata.org.
  9. [10] ↑ . wikidata.org.
  10. [11] ↑ . wikidata.org.
  11. [12] ↑ . wikidata.org.
  12. [13] ↑ . wikidata.org.
  13. [14] ↑ . wikidata.org.
  14. [15] ↑ . wikidata.org.
  15. [16] ↑ . wikidata.org.
  16. [17] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). New Algorithm and Data Structures for the All Pairs Shortest Path Problem. Retrieved May 3, 2026, from https://4ort.xyz/entity/new-algorithm-and-data-structures-for-the-all-pairs-shortest-path-problem
MLA “New Algorithm and Data Structures for the All Pairs Shortest Path Problem.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/new-algorithm-and-data-structures-for-the-all-pairs-shortest-path-problem.
BibTeX @misc{4ortxyz_new-algorithm-and-data-structures-for-the-all-pairs-shortest-path-problem_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{New Algorithm and Data Structures for the All Pairs Shortest Path Problem}}, year = {2026}, url = {https://4ort.xyz/entity/new-algorithm-and-data-structures-for-the-all-pairs-shortest-path-problem}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): New Algorithm and Data Structures for the All Pairs Shortest Path Problem — https://4ort.xyz/entity/new-algorithm-and-data-structures-for-the-all-pairs-shortest-path-problem (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/new-algorithm-and-data-structures-for-the-all-pairs-shortest-path-problem · Last refreshed:

Edit History

Rolling log of changes to this entity's Wikidata record. Values shown reflect the current state of each edited property — follow the history link to see the precise diff for any edit.

  1. 11d ago · DrThneed · 2026-09-06 view diff on Wikidata ↗
    Thesis submitted for degree → Doctor of Philosophy
    Author name string → Mashitoh Hashim
    Thesis submitted to → University of Canterbury
    Handle id → 10092/8196
    + 15 other properties edited (see Wikidata diff for full list)
    "/* wbeditentity-update:0| */ QuickStatements 3.0 [[:toollabs:qs-dev/batch/52330|batch #52330]]: Canterbury"
Live feed via Wikidata EventStreams. New edits appear within minutes of being made on Wikidata.