{"_buckets": {"deposit": "15c355cb-b2c0-45f3-b000-97284009ba2f"}, "_deposit": {"id": "386", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "386"}, "status": "published"}, "_oai": {"id": "oai:repository.nii.ac.jp:00000386", "sets": ["136"]}, "author_link": [], "control_number": "386", "item_5_biblio_info_30": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2003-07-03", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "9", "bibliographicPageStart": "1", "bibliographic_titles": [{"bibliographic_title": "NIIテクニカル・レポート", "bibliographic_titleLang": "ja"}, {"bibliographic_title": "NII Technical Report", "bibliographic_titleLang": "en"}]}]}, "item_5_description_28": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "In this paper we give an algorithm to generate all rooted trees with at most n vertices. The algorithm generates each tree in constant time on average. Furthermore the algorithm is simple, and clarifies a simple relation among the trees, that is a family tree of trees, and outputs trees based on the relation.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_5_identifier_registration": {"attribute_name": "ID登録", "attribute_value_mlt": [{"subitem_identifier_reg_text": "10.20736/0000000386", "subitem_identifier_reg_type": "JaLC"}]}, "item_5_publisher_31": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "国立情報学研究所", "subitem_publisher_language": "ja"}]}, "item_5_source_id_32": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1346-5597", "subitem_source_identifier_type": "ISSN"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "中野, 愼一", "creatorNameLang": "ja"}, {"creatorName": "Nakano, Shin-ichi", "creatorNameLang": "en"}]}, {"creatorNames": [{"creatorName": "宇野, 毅明", "creatorNameLang": "ja"}, {"creatorName": "Uno, Takeaki", "creatorNameLang": "en"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2015-08-27"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "03-005E.pdf", "filesize": [{"value": "142.6 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 142600.0, "url": {"label": "NII Technical Report (NII-2003-005E)：Efficient Generation of Rooted Trees", "url": "https://repository.nii.ac.jp/record/386/files/03-005E.pdf"}, "version_id": "d6fcde70-6087-4738-bca6-31234e009e0a"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "テクニカルレポート", "subitem_subject_language": "ja", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Technical Report", "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": "NII Technical Report (NII-2003-005E)：Efficient Generation of Rooted Trees", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "NII Technical Report (NII-2003-005E)：Efficient Generation of Rooted Trees", "subitem_title_language": "en"}]}, "item_type_id": "5", "owner": "1", "path": ["136"], "permalink_uri": "https://doi.org/10.20736/0000000386", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2003-07-03"}, "publish_date": "2003-07-03", "publish_status": "0", "recid": "386", "relation": {}, "relation_version_is_last": true, "title": ["NII Technical Report (NII-2003-005E)：Efficient Generation of Rooted Trees"], "weko_shared_id": -1}