{"created":"2023-05-15T12:31:09.418572+00:00","id":716,"links":{},"metadata":{"_buckets":{"deposit":"9f8e80b4-b3be-4aec-a330-d90470584988"},"_deposit":{"created_by":6,"id":"716","owners":[6],"pid":{"revision_id":0,"type":"depid","value":"716"},"status":"published"},"_oai":{"id":"oai:fit.repo.nii.ac.jp:00000716","sets":["256:257:373"]},"author_link":["3325"],"item_3_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1995-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"211","bibliographicPageStart":"201","bibliographicVolumeNumber":"27","bibliographic_titles":[{"bibliographic_title":"福岡工業大学研究論集"},{"bibliographic_title":"RESEARCH BULLETIN OF FUKUOKA INSTITUTE OF TECHNOLOGY","bibliographic_titleLang":"en"}]}]},"item_3_description_17":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_3_description_47":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"subitem_description":"論文(Article)","subitem_description_type":"Other"}]},"item_3_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"Let D be a directed tree. If deg⁻ (r)=O for some vertex r ED, and deg⁻ (v)=l for any vertex v ED with v ≠ r ,then r is called a root and D is called a rooted tree. A sequence of nonnegative integers S=(s₁, s₂,…， sn）is a rooted tree sequence if there is a rooted tree with vertices V₁, V₂,…， Vn such that deg⁺（vj＝sj for each j = 1, 2,…， n. The rooted tree sequence problem is: Given a sequence of nonnegative integers, determine whether it is a rooted tree sequence or not. In this paper, I consider several variations of the rooted tree sequence problem and give linear time algorithms. ","subitem_description_type":"Other"}]},"item_3_publisher_37":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"福岡工業大学"}]},"item_3_source_id_7":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"02876620","subitem_source_identifier_type":"ISSN"}]},"item_3_text_38":{"attribute_name":"出版者（ヨミ）","attribute_value_mlt":[{"subitem_text_value":"フクオカ コウギョウ ダイガク"}]},"item_3_text_39":{"attribute_name":"別言語の出版者","attribute_value_mlt":[{"subitem_text_value":"Fukuoka Institute of Technology"}]},"item_3_text_48":{"attribute_name":"資源タイプ・ローカル","attribute_value_mlt":[{"subitem_text_value":"紀要論文"}]},"item_3_text_49":{"attribute_name":"資源タイプ・NII","attribute_value_mlt":[{"subitem_text_value":"Departmental Bulletin Paper"}]},"item_3_text_50":{"attribute_name":"資源タイプ・DCMI","attribute_value_mlt":[{"subitem_text_value":"text"}]},"item_3_text_51":{"attribute_name":"資源タイプ・ローカル表示コード","attribute_value_mlt":[{"subitem_text_value":"02"}]},"item_3_version_type_19":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"TAKAHASHI, Masaya"}],"nameIdentifiers":[{"nameIdentifier":"3325","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","displaytype":"detail","filename":"27(2)-201.pdf","filesize":[{"value":"645.6 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://fit.repo.nii.ac.jp/record/716/files/27(2)-201.pdf"},"version_id":"dcef39f4-09f4-432f-967b-ecfe03050f76"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"minium depth","subitem_subject_scheme":"Other"},{"subitem_subject":"leveled rooted tree","subitem_subject_scheme":"Other"},{"subitem_subject":"tournament tree","subitem_subject_scheme":"Other"},{"subitem_subject":"score sequence","subitem_subject_scheme":"Other"},{"subitem_subject":"optimal and optimum condition","subitem_subject_scheme":"Other"},{"subitem_subject":"minium depth","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"leveled rooted tree","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"tournament tree","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"score sequence","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"optimal and optimum condition","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Rooted Tree Sequence Problems","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Rooted Tree Sequence Problems"},{"subitem_title":"Rooted Tree Sequence Problems","subitem_title_language":"en"}]},"item_type_id":"3","owner":"6","path":["373"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-02"},"publish_date":"2021-03-02","publish_status":"0","recid":"716","relation_version_is_last":true,"title":["Rooted Tree Sequence Problems"],"weko_creator_id":"6","weko_shared_id":-1},"updated":"2023-05-15T14:01:47.833409+00:00"}