{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032174","sets":["1164:2592:2659:2662"]},"path":["2662"],"owner":"1","recid":"32174","title":["部分k?木の全彩色を求める多項式時間アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"1998-07-22"},"_buckets":{"deposit":"abe28775-e49e-4c2d-b4e3-129239c0ed9c"},"_deposit":{"id":"32174","pid":{"type":"depid","value":"32174","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"部分k?木の全彩色を求める多項式時間アルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"部分k?木の全彩色を求める多項式時間アルゴリズム"},{"subitem_title":"A Polynomial - Time Algorithm for Finding Total Colorings of Partial k - Trees","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1998-07-22","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":"Graduate School of Information Sciences Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences Tohoku 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/32174/files/IPSJ-AL98063005.pdf"},"date":[{"dateType":"Available","dateValue":"2000-07-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL98063005.pdf","filesize":[{"value":"494.8 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":"aef2d8a7-a191-4d78-8468-ef5fbda31e25","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1998 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"磯辺, 秀司"},{"creatorName":"周暁"},{"creatorName":"西関, 隆夫"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Isobe, Shuji","creatorNameLang":"en"},{"creatorName":"Zhou, Xiao","creatorNameLang":"en"},{"creatorName":"Takao, Nishizeki","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":"グラフGの全彩色とはGの全ての点と辺をどの隣接する2点，どの隣接する2辺，どの1点とそれに接続する辺も全て異なる色になるように彩色することである．様々な問題が部分k?木に対して効率良く解けるが，与えられた部分k?木の，最小色数を用いた全彩色を求める多項式時間アルゴリズムはまだ知られていなかった．本文ではそのような最初のアルゴリズムを与える．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A total coloring of a graph G is a coloring of all elements of G, i.e. Vertices and edges, in such a way that no two adjacent or incident elements receive the same color. Many combinatorial problems can be efficiently solved for partial k-trees (graphs of treewidth bounded by a constant k). However, no polynomial-time algorithm has been known for the problem of finding a total coloring of a given partial k-tree with the minimum number of colors. This paper gives such a first polynomial-time algorithm.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"40","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"33","bibliographicIssueDates":{"bibliographicIssueDate":"1998-07-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"62(1998-AL-063)","bibliographicVolumeNumber":"1998"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32174,"updated":"2025-01-22T16:17:27.929831+00:00","links":{},"created":"2025-01-18T23:01:19.716817+00:00"}