{"id":{"repo_id":"clemson","oai_identifier":"oai:open.clemson.edu:arv_theses-1329"},"canonical_url":"https://search.ndltd.org/etd/clemson/oai:open.clemson.edu:arv_theses-1329","repository":{"repo_id":"clemson","name":"Clemson University","base_url":"https://open.clemson.edu/do/oai/"},"display":{"title":"A Shortest Path Algorithm Using Backward Dynamic Programming","abstract":null,"abstract_html":null,"abstract_has_math":false,"creators":["Cullen, Wendy"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Mathematical Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:12:39Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://open.clemson.edu/arv_theses/330","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://open.clemson.edu/arv_theses/330","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.clemson.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopen.clemson.edu%3Aarv_theses-1329","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Cullen, Wendy"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["1992-12-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://open.clemson.edu/arv_theses/330"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:title","label":"Title","values":["A Shortest Path Algorithm Using Backward Dynamic Programming"]}]}],"canonical_facts":{"dc:creator":["Cullen, Wendy"],"dc:date.created":["1992-12-01T08:00:00Z"],"dc:identifier":["https://open.clemson.edu/arv_theses/330"],"dc:title":["A Shortest Path Algorithm Using Backward Dynamic Programming"],"thesis:degree_discipline":["Mathematical Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T07:12:39Z"}