{"updated":"2025-01-22T16:34:01.946129+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00031626","sets":["1164:2592:2593:2598"]},"path":["2598"],"owner":"1","recid":"31626","title":["平面グラフの刻み幅決定アルゴリズムの小交差数グラフへの拡張に向けて"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-03-07"},"_buckets":{"deposit":"2bafb10c-7189-4229-8c29-a0beb105c552"},"_deposit":{"id":"31626","pid":{"type":"depid","value":"31626","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":"Towards an extension of the planar graph carving-width algorithm to graphs with few-crossings.","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2008-03-07","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"明治大学理工学部情報科学科"},{"subitem_text_value":"明治大学理工学部情報科学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, Meiji University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, 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/31626/files/IPSJ-AL08117010.pdf"},"date":[{"dateType":"Available","dateValue":"2010-03-07"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL08117010.pdf","filesize":[{"value":"673.4 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":"631e63f0-16e6-420e-bef1-fc32caef6a5e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"玉木, 久夫"},{"creatorName":"吉武, 由実"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hisao, Tamaki","creatorNameLang":"en"},{"creatorName":"Yumi, Yoshitake","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":"平面グラフの刻み幅を決定する Seymour と Thomas の「ねずみ捕りアルゴリズム」の正当性証明のひとつの鍵となる補題の新しい証明を与える．この証明は，ねずみ捕りアルゴリズムを平面グラフよりも広いクラスに拡張するための基礎となると期待される．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We give a new proof of a key lemma in the correctness of proof of the \"rat-catching algorighm\" of Seymour and Thomas which decides the carving-width of planar graphs. This proof is expected to form a basis for extending the rat-catching algorithm to a broader class of graphs.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"74","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"67","bibliographicIssueDates":{"bibliographicIssueDate":"2008-03-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"24(2008-AL-117)","bibliographicVolumeNumber":"2008"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:00:55.060502+00:00","id":31626,"links":{}}