{"created":"2025-01-18T23:40:55.915127+00:00","updated":"2025-01-21T15:17:57.105496+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00091767","sets":["1164:2592:7086:7157"]},"path":["7157"],"owner":"11","recid":"91767","title":["A Linear Edge Kernel for Two-Layer Crossing Minimization"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-05-10"},"_buckets":{"deposit":"808383c4-d874-49d3-96d4-6c995c7d9f1a"},"_deposit":{"id":"91767","pid":{"type":"depid","value":"91767","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"A Linear Edge Kernel for Two-Layer Crossing Minimization","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Linear Edge Kernel for Two-Layer Crossing Minimization"},{"subitem_title":"A Linear Edge Kernel for Two-Layer Crossing Minimization","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2013-05-10","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Meiji University"},{"subitem_text_value":"Meiji University"},{"subitem_text_value":"Business Information Technical Systems"},{"subitem_text_value":"Meiji University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Meiji University","subitem_text_language":"en"},{"subitem_text_value":"Meiji University","subitem_text_language":"en"},{"subitem_text_value":"Business Information Technical Systems","subitem_text_language":"en"},{"subitem_text_value":"Meiji University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/91767/files/IPSJ-AL13144004.pdf"},"date":[{"dateType":"Available","dateValue":"2015-05-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL13144004.pdf","filesize":[{"value":"454.7 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":"46074f6f-ee1b-48af-ac35-806c26b45d82","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2013 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasuaki, Kobayashi"},{"creatorName":"Hirokazu, Maruta"},{"creatorName":"Yusuke, Nakae"},{"creatorName":"Hisao, Tamaki"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasuaki, Kobayashi","creatorNameLang":"en"},{"creatorName":"Hirokazu, Maruta","creatorNameLang":"en"},{"creatorName":"Yusuke, Nakae","creatorNameLang":"en"},{"creatorName":"Hisao, Tamaki","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":"We consider a simple generalization of two-layer crossing minimization problem (TLCM) called leaf-edge-weighted TLCM (LEW-TLCM), where we allow positive weights on edges incident to leaves, and show that this problem admits a kernel with O(k) edges provided that the given graph is connected. As a straightforward consequence, LEW-TLCM (and hence TLCM) has a fixed parameter algorithm that runs in 2O(k log k) + nO(1) time which improves on the previously best known algorithm with running time 2O(k3)n.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We consider a simple generalization of two-layer crossing minimization problem (TLCM) called leaf-edge-weighted TLCM (LEW-TLCM), where we allow positive weights on edges incident to leaves, and show that this problem admits a kernel with O(k) edges provided that the given graph is connected. As a straightforward consequence, LEW-TLCM (and hence TLCM) has a fixed parameter algorithm that runs in 2O(k log k) + nO(1) time which improves on the previously best known algorithm with running time 2O(k3)n.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"4","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2013-05-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"2013-AL-144"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":91767,"links":{}}