{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00152708","sets":["8512:8630:8632:8560"]},"path":["8560"],"owner":"1","recid":"152708","title":["LA-11 直並列グラフをリスト辺彩色するアルゴリズム(A. アルゴリズム・基礎)"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-09-13"},"_buckets":{"deposit":"33709f02-889b-4c14-a2b0-ec8196980f26"},"_deposit":{"id":"152708","pid":{"type":"depid","value":"152708","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"LA-11 直並列グラフをリスト辺彩色するアルゴリズム(A. アルゴリズム・基礎)","author_link":["267487","267489","267488","267492","267490","267491"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"LA-11 直並列グラフをリスト辺彩色するアルゴリズム(A. アルゴリズム・基礎)"},{"subitem_title":"LA-11 Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs","subitem_title_language":"en"}]},"item_type_id":"26","publish_date":"2002-09-13","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_26_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東北大学大学院情報科学研究科"},{"subitem_text_value":"東北大学大学院情報科学研究科"},{"subitem_text_value":"東北大学大学院情報科学研究科"}]},"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/152708/files/KJ00006452475.pdf"},"date":[{"dateType":"Available","dateValue":"2002-09-13"}],"format":"application/pdf","filename":"KJ00006452475.pdf","filesize":[{"value":"187.0 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"af363e67-a6df-4306-9c80-88c9b2135aeb","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 by IEICE,IPSJ"}]},"item_26_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"藤野, 友也"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"周, 暁"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"西関, 隆夫"}],"nameIdentifiers":[{}]}]},"item_26_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Fujino, Tomoya","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Zhou, Xiao","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Nishizeki, Takao","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_26_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11740456","subitem_source_identifier_type":"NCID"}]},"item_26_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本文では,(単純)直並列グラフGの各辺vw∈E(G)に対して,リストLが|vw)|≥max{3,d(v),d(w)}を満たすならば,Gがリスト辺彩色可能であることを示す.またそのようなリストLに対してGのリスト辺彩色を求めるO(Δn)時間アルゴリズムを与える.ここで,d(v), d(w)はそれぞれGにおける点v,wの次数,ΔはGの最大次数,nはGの点数である.","subitem_description_type":"Other"}]},"item_26_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"22","bibliographic_titles":[{"bibliographic_title":"情報技術レターズ"}],"bibliographicPageStart":"21","bibliographicIssueDates":{"bibliographicIssueDate":"2002-09-13","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"1"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":152708,"updated":"2025-01-20T15:20:10.027241+00:00","links":{},"created":"2025-01-19T00:27:11.869710+00:00"}