{"created":"2023-06-20T16:36:57.936870+00:00","id":6671,"links":{},"metadata":{"_buckets":{"deposit":"c2040f5c-0eac-4647-aa87-39b156aa7f47"},"_deposit":{"created_by":3,"id":"6671","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"6671"},"status":"published"},"_oai":{"id":"oai:kindai.repo.nii.ac.jp:00006671","sets":["14:923:1711:1741","21:3039:3241:3249"]},"author_link":["11233","11234"],"item_2_alternative_title_3":{"attribute_name":"その他（別言語等）のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"An Algorithm and Data Structure for Shortest Path Search Considering Node Costs"}]},"item_2_biblio_info_21":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2000-12-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"34","bibliographicPageEnd":"80","bibliographicPageStart":"77","bibliographic_titles":[{"bibliographic_title":"近畿大学工学部研究報告"},{"bibliographic_title":"Research reports of the School of Engineering, Kinki University","bibliographic_titleLang":"en"}]}]},"item_2_publisher_14":{"attribute_name":"出版者 名前","attribute_value_mlt":[{"subitem_publisher":"近畿大学工学部"}]},"item_2_source_id_22":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0386491X","subitem_source_identifier_type":"ISSN"}]},"item_2_text_7":{"attribute_name":"著者(英)","attribute_value_mlt":[{"subitem_text_language":"en","subitem_text_value":"Igarashi, Harukazu"},{"subitem_text_language":"en","subitem_text_value":"Iidoi, Shuichi"}]},"item_2_text_8":{"attribute_name":"著者 所属","attribute_value_mlt":[{"subitem_text_value":"近畿大学工学部電子情報工学科"},{"subitem_text_value":"近畿大学大学院工業技術研究科システム制御専攻"}]},"item_2_text_9":{"attribute_name":"著者所属(翻訳)","attribute_value_mlt":[{"subitem_text_value":"Department of Electronic Engineering and Computer Science"},{"subitem_text_value":"Program in Systems and Technology, Graduate School of Industrial Technology"}]},"item_2_version_type_12":{"attribute_name":"版","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_be7fb7dd8ff6fe43","subitem_version_type":"NA"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"metadata only access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_14cb"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"五十嵐,  治一"},{"creatorName":"イガラシ, ハルカズ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"11233","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"飯土井,  修一"},{"creatorName":"イイドイ, シュウイチ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"11234","nameIdentifierScheme":"WEKO"}]}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"ノードコストを考慮した最短経路探索法とデータ構造","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ノードコストを考慮した最短経路探索法とデータ構造"}]},"item_type_id":"2","owner":"3","path":["1741","3249"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-05-12"},"publish_date":"2009-05-12","publish_status":"0","recid":"6671","relation_version_is_last":true,"title":["ノードコストを考慮した最短経路探索法とデータ構造"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-06-21T00:27:36.276816+00:00"}