{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032175","sets":["1164:2592:2659:2662"]},"path":["2662"],"owner":"1","recid":"32175","title":["正補混合表現によるグラフ探索時間の削減"],"pubdate":{"attribute_name":"公開日","attribute_value":"1998-07-22"},"_buckets":{"deposit":"b248f646-c424-44cf-b78b-8a608078bd80"},"_deposit":{"id":"32175","pid":{"type":"depid","value":"32175","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"正補混合表現によるグラフ探索時間の削減","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"正補混合表現によるグラフ探索時間の削減"},{"subitem_title":"Decrease in the time of graph search on original -complement- mixed representations","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1998-07-22","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"豊橋技術科学大学情報工学系"},{"subitem_text_value":"豊橋技術科学大学情報工学系"},{"subitem_text_value":"豊橋技術科学大学情報工学系"},{"subitem_text_value":"豊橋技術科学大学情報工学系"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Toyohasi University of Tecnology Department of Information and Computer Sciences","subitem_text_language":"en"},{"subitem_text_value":"Toyohasi University of Tecnology Department of Information and Computer Sciences","subitem_text_language":"en"},{"subitem_text_value":"Toyohasi University of Tecnology Department of Information and Computer Sciences","subitem_text_language":"en"},{"subitem_text_value":"Toyohasi University of Tecnology Department of Information and Computer Sciences","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/32175/files/IPSJ-AL98063006.pdf"},"date":[{"dateType":"Available","dateValue":"2000-07-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL98063006.pdf","filesize":[{"value":"644.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"05da885f-0a3f-4138-bd27-7114ac5f23ae","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1998 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"藤田, 正人"},{"creatorName":"伊藤大雄"},{"creatorName":"上原, 秀幸"},{"creatorName":"横山, 光雄"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masato, Fujita","creatorNameLang":"en"},{"creatorName":"Hiro, Ito","creatorNameLang":"en"},{"creatorName":"Hideyuki, Uehara","creatorNameLang":"en"},{"creatorName":"Mitsuo, Yokoyama","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"単純グラフは補グラフを用いても表現でき、枝数が密である時は補グラフ表現の方がデータ量が少なくてすむ。ただこの表現法によって、これまで線形時間アルゴリズムであるとされてきたものに対して、線形時間可解性が保証されない可能性が生じる。しかし著者らによって、単純グラフに対する既存の線形時間探索アルゴリズムにおいて、補グラフ表現を用いても線形時間で動作するアルゴリズムが提案された。本報告では、グラフのそれぞれの節点の隣接枝数の密度に着目し、グラフ全体での枝数の密度に関係なく、グラフを表現するデータ量が削減できる単純グラフの表現法を提案する。そして、幅優先探索および深さ優先探索に対し、提案する表現法を用いても線形時間で動作するアルゴリズムを提案する。さらに、提案するアルゴリズムの計算時間を数値実験により評価し、その結果からグラフ探索時間の削減が可能であることが示された。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Simple graphs can be represented by the complement graphs. When the complement graph includes smaller number of edges than an original one, using the complement-graph-representation reduces the space of memories for representing a graph. The authors have presented linear time breadth first search (BFS) and depth first serch (DFS) algorithms for the complement graph representations before. This paper presents original-complement-mixed (OCM in short) representations, which decreases the space of memories for representing an original graph. The paper also shows that for a given OCM represented grpah, BFS tree and DFS tree of the original graph can be constructed in linear-time. Furthermore, it shows that the running time of BFS and DFS on the OCM representations are faster than ones of original representations, by computer examinations.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"48","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"41","bibliographicIssueDates":{"bibliographicIssueDate":"1998-07-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"62(1998-AL-063)","bibliographicVolumeNumber":"1998"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32175,"updated":"2025-01-22T16:17:29.565635+00:00","links":{},"created":"2025-01-18T23:01:19.761639+00:00"}