{"id":32479,"updated":"2025-01-22T16:09:36.159183+00:00","links":{},"created":"2025-01-18T23:01:33.495453+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032479","sets":["1164:2592:2693:2697"]},"path":["2697"],"owner":"1","recid":"32479","title":["グラフ次数列問題"],"pubdate":{"attribute_name":"公開日","attribute_value":"1993-05-28"},"_buckets":{"deposit":"e396d3dc-0c61-4be6-9a48-60daf4c1a132"},"_deposit":{"id":"32479","pid":{"type":"depid","value":"32479","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":"Graphical Degree Sequence Problems","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1993-05-28","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":"Department of Electronic Engineering, Aichi College of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and System Engineering","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and System Engineering","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/32479/files/IPSJ-AL93033015.pdf"},"date":[{"dateType":"Available","dateValue":"1995-05-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL93033015.pdf","filesize":[{"value":"1.2 MB"}],"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":"3e0106d5-39f4-438f-baf5-da2724869aa6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1993 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":"Masaya, Takahashi","creatorNameLang":"en"},{"creatorName":"Keiko, Imai","creatorNameLang":"en"},{"creatorName":"Takao, Asano","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":"非負整数の列S=(_1,s_2,…,s_)がグラフ的であるとは、それを次数列としてもつようなグラフが存在することであり、グラフ次数列問題とは、与えられた非負整数列S=(_1,s_2,…,s_)に対して、Sがグラフ的であるかどうかを判定し、もしそうならば、Sを次数列としてもつグラフを構成する問題である。本論文では、各種のグラフ次数列問題を考え、効率的アルゴリズムを与える。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A sequence of nonnegative integers S=(s_1,s_2,…,s_n) is graphical if there is a graph with vertices υ_1,υ_2,…,υ_n such that deg(υ_i) = s_i for each i = 1,2,…,n. The graphical degree sequence problem is: Given a sequence S of nonnegative integers, determine whether it is graphical and, if so, construct a graph having S as a degree sequence. In this paper, we consider several variations of the graphical degree sequence problem and give efficient algorithm.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"118","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム(AL)"}],"bibliographicPageStart":"111","bibliographicIssueDates":{"bibliographicIssueDate":"1993-05-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"48(1993-AL-033)","bibliographicVolumeNumber":"1993"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}