{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032018","sets":["1164:2592:2640:2642"]},"path":["2642"],"owner":"1","recid":"32018","title":["描画固定部分グラフを有するグラフにおける全域平面グラフの階層的抽出法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-09-25"},"_buckets":{"deposit":"03415976-f53c-4be5-bda9-b7a75c8398bf"},"_deposit":{"id":"32018","pid":{"type":"depid","value":"32018","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":"Hierarchical Extraction of a Spanning Planar Subgraph under Fixed Embedding of Specified Subgraphs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2001-09-25","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":"Graduate School of Engineering, Hiroshima University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, Hiroshima University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, Hiroshima University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, Hiroshima University","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/32018/files/IPSJ-AL01080001.pdf"},"date":[{"dateType":"Available","dateValue":"2003-09-25"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL01080001.pdf","filesize":[{"value":"750.5 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":"978e4e14-d906-4daa-b95f-c0b3088a1521","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2001 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":"Shinichiro, Anegayama","creatorNameLang":"en"},{"creatorName":"Daisuke, Takafuji","creatorNameLang":"en"},{"creatorName":"Satoshi, Taoka","creatorNameLang":"en"},{"creatorName":"Toshimasa, Watanabe","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":"本稿では描画固定の部分グラフを含むグラフに対する全域平面最大部分グラフ抽出問題の発見的解法として，O(|V|^2)アルゴリズム plan_divide を提案する．描画が固定された部分グラフを含むグラフからの平面的グラフの抽出は応用上極めて有用である．plan_divide はこのような機能を持ち，かつ既存手法では処理不可能な大規模グラフ G = (V E)からの抽出を高速に行う．まず，|E| > max_edge なる G = (V E) を，辺数が max_edge 以下のいくつかのグラフG_iに分割した後，各G_iにおいて描画固定の部分グラフを含む全域平面的部分グラフを抽出し，このことと分割された部分グラフ間を接続する辺集合からの平面辺抽出に基づいてGの全域平面部分グラフを求める．但し，max_edgは既存手法で処理可能な辺数の上限を表わす．さらに，計算機による既存手法との比較実験を行い，plan_divide の性能を実験的に比較評価する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we present an O(|V|^2) heuristic algorithm plan_divide for hierarchically extracting a spanning subgraph under fixed embedding of some specified subgraphs. The purpose of plan_divide is to find a  spanning planar subgraph of a huge given graph G = (V,E) having some subgraphs that requires fixed embedding. Let max_edge be the maximum cardinality of an edge set that existing planarization algorithm can deal with. First, plan_divide divides G with |E| > max_edge into some small graphs G_i = (V_i,E_i) with |E_i| <= max_edge for some i >= 1. Then plan_divide extracts a  spanning planar subgraph of each G_i, and then finds planar edges from those connecting pairs of subgraphs G_i and G_j ( i \\neq j). Furthermore, experimental results are given to  compare plan_divide with other planarization algorithms, and to evaluate performance of plan_divide experimentally.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2001-09-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"93(2001-AL-080)","bibliographicVolumeNumber":"2001"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"updated":"2025-01-22T16:21:45.624265+00:00","created":"2025-01-18T23:01:12.680377+00:00","links":{},"id":32018}