{"created":"2023-05-15T12:31:08.874769+00:00","id":708,"links":{},"metadata":{"_buckets":{"deposit":"6203d02f-64ca-4c7b-a83e-d05106582aec"},"_deposit":{"created_by":6,"id":"708","owners":[6],"pid":{"revision_id":0,"type":"depid","value":"708"},"status":"published"},"_oai":{"id":"oai:fit.repo.nii.ac.jp:00000708","sets":["256:257:372"]},"author_link":["3291"],"item_3_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1996","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"232","bibliographicPageStart":"229","bibliographicVolumeNumber":"28","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":"A sequence of nonnegative integers S= (s₁, s₂, · · · ·, sn) is graphical if there is a graph with vertices v₁, V₂, · · · ·, Vn such that deg(vj) = si for each j = 1, 2, · · · ·, n. The graphical degree sequence problem is: Given a sequence of nonnegative integers, determine whether it is graphical or not. In this paper, we consider the k-partite multidigraphical degree sequence problem and bipartite digraphical one, and give efficient algorithms for them. ","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":"3291","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","displaytype":"detail","filename":"28(2)_229.pdf","filesize":[{"value":"292.3 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://fit.repo.nii.ac.jp/record/708/files/28(2)_229.pdf"},"version_id":"76511317-5416-4c9a-8f98-8fb9fb7c4647"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"k-partite directed multigraph","subitem_subject_scheme":"Other"},{"subitem_subject":"bipartite directed graph","subitem_subject_scheme":"Other"},{"subitem_subject":"nonnegative integers and efficient algorithms","subitem_subject_scheme":"Other"},{"subitem_subject_scheme":"Other"},{"subitem_subject":"k-partite directed multigraph","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"bipartite directed graph","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"nonnegative integers and efficient algorithms","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"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":"Bipartite Digraphical Degree Sequence Problem","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Bipartite Digraphical Degree Sequence Problem"},{"subitem_title":"Bipartite Digraphical Degree Sequence Problem","subitem_title_language":"en"}]},"item_type_id":"3","owner":"6","path":["372"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-02-26"},"publish_date":"2021-02-26","publish_status":"0","recid":"708","relation_version_is_last":true,"title":["Bipartite Digraphical Degree Sequence Problem"],"weko_creator_id":"6","weko_shared_id":-1},"updated":"2023-05-15T14:01:14.549817+00:00"}