{"created":"2025-01-19T00:46:10.354728+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00176529","sets":["1164:2592:9018:9019"]},"path":["9019"],"owner":"11","recid":"176529","title":["交差数の少ない単一ページ描画における固定パラメータアルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-01-10"},"_buckets":{"deposit":"2c9fa25d-ee0d-48a8-9eec-d8883d1ecef6"},"_deposit":{"id":"176529","pid":{"type":"depid","value":"176529","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"交差数の少ない単一ページ描画における固定パラメータアルゴリズム","author_link":["371757","371758","371759"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"交差数の少ない単一ページ描画における固定パラメータアルゴリズム"}]},"item_type_id":"4","publish_date":"2017-01-10","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"明治大学"},{"subitem_text_value":"京都大学"},{"subitem_text_value":"明治大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Meiji University","subitem_text_language":"en"},{"subitem_text_value":"Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Meiji 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/176529/files/IPSJ-AL17161003.pdf","label":"IPSJ-AL17161003.pdf"},"date":[{"dateType":"Available","dateValue":"2019-01-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL17161003.pdf","filesize":[{"value":"322.2 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":"83bb7429-e64d-46f0-9749-fab159f535d5","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2017 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"大塚, 広夢"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"小林, 靖明"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"玉木, 久夫"}],"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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"グラフの本型埋め込みの研究は古くから行われ，その拡張として，少ないページ数に少ない辺交差数でグラフを埋め込む問題が考えられている．ここでは，n 頂点のグラフ G と非負整数kが与えられたとき，G が 1 ページに辺の交差数が高々 k で埋め込みができるかを判定する問題を考える．この問題は Bannister と Eppstein (GD 2014) によって固定パラメータ容易であることが示されたが，その結果の中では Courcelle の定理を用いているため，アルゴリズムやその計算時間は陽に示されていない．本稿では，その判定問題に対する 2O (k log k) n 時間アルゴリズムを与える．この結果は，既存の手法に対して単純に動的計画法を与えるのではなく，1 ページ描画に関する非自明な性質を用いたアルゴリズムである．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2017-01-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2017-AL-161"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"links":{},"id":176529,"updated":"2025-01-20T05:49:17.857560+00:00"}