WEKO3
アイテム
{"_buckets": {"deposit": "a5648310-a4c7-4409-8753-4b1027cb6c5c"}, "_deposit": {"created_by": 18, "id": "10264", "owners": [18], "pid": {"revision_id": 0, "type": "depid", "value": "10264"}, "status": "published"}, "_oai": {"id": "oai:muroran-it.repo.nii.ac.jp:00010264", "sets": ["46", "489"]}, "author_link": ["57709", "57701", "59462"], "item_79_biblio_info_10": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2013", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "11", "bibliographicPageEnd": "2332", "bibliographicPageStart": "2327", "bibliographicVolumeNumber": "E96D", "bibliographic_titles": [{"bibliographic_title": "IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS", "bibliographic_titleLang": "en"}]}]}, "item_79_description_23": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_description": "application/pdf", "subitem_description_type": "Other"}]}, "item_79_description_7": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "We consider the minimum feedback vertex set problem for some bipartite graphs and degree-constrained graphs. We show that the problem is linear time solvable for bipartite permutation graphs and NP-hard for grid intersection graphs. We also show that the problem is solvable in O(n(2) log(6) n) time for n-vertex graphs with maximum degree at most three.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_79_link_17": {"attribute_name": "出版者版へのリンク", "attribute_value_mlt": [{"subitem_link_text": "10.1587/transinf.E96.D.2327", "subitem_link_url": "https://doi.org/10.1587/transinf.E96.D.2327"}]}, "item_79_link_5": {"attribute_name": "室蘭工業大学研究者データベースへのリンク", "attribute_value_mlt": [{"subitem_link_text": "髙岡 旭(TAKAOKA Asahi)", "subitem_link_url": "http://rdsoran.muroran-it.ac.jp/html/200000242_ja.html"}]}, "item_79_publisher_11": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG", "subitem_publisher_language": "en"}]}, "item_79_relation_18": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isIdenticalTo", "subitem_relation_type_id": {"subitem_relation_type_id_text": "10.1587/transinf.E96.D.2327", "subitem_relation_type_select": "DOI"}}]}, "item_79_relation_20": {"attribute_name": "参考URL", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_language": "en", "subitem_relation_name_text": "IEICE Transactions Online TOP"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://search.ieice.org/index.html", "subitem_relation_type_select": "URI"}}]}, "item_79_rights_19": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright © 2013 IEICE", "subitem_rights_language": "en"}]}, "item_79_source_id_12": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1745-1361", "subitem_source_identifier_type": "EISSN"}]}, "item_79_subject_9": {"attribute_name": "日本十進分類法", "attribute_value_mlt": [{"subitem_subject": "548", "subitem_subject_scheme": "NDC"}]}, "item_79_text_4": {"attribute_name": "著者ID(非表示)", "attribute_value_mlt": [{"subitem_text_value": "20999401"}]}, "item_79_version_type_21": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorAffiliations": [{"affiliationNameIdentifiers": [{"affiliationNameIdentifier": "10103", "affiliationNameIdentifierScheme": "kakenhi"}], "affiliationNames": [{"affiliationName": "室蘭工業大学", "affiliationNameLang": "ja"}, {"affiliationName": "Muroran Institute of Technology", "affiliationNameLang": "en"}]}], "creatorNames": [{"creatorName": "髙岡, 旭", "creatorNameLang": "ja"}, {"creatorName": "TAKAOKA, Asahi", "creatorNameLang": "en"}, {"creatorName": "タカオカ, アサヒ", "creatorNameLang": "ja-Kana"}], "familyNames": [{"familyName": "髙岡", "familyNameLang": "ja"}, {"familyName": "TAKAOKA", "familyNameLang": "en"}, {"familyName": "タカオカ", "familyNameLang": "ja-Kana"}], "givenNames": [{"givenName": "旭", "givenNameLang": "ja"}, {"givenName": "Asahi", "givenNameLang": "en"}, {"givenName": "アサヒ", "givenNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "59462", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "1000060783587", "nameIdentifierScheme": "NRID", "nameIdentifierURI": "https://nrid.nii.ac.jp/ja/nrid/1000060783587"}]}, {"creatorAffiliations": [{"affiliationNameIdentifiers": [], "affiliationNames": [{"affiliationName": "", "affiliationNameLang": "ja"}]}], "creatorNames": [{"creatorName": "TAYU, Satoshi", "creatorNameLang": "en"}, {"creatorName": "田湯, 智", "creatorNameLang": "ja"}, {"creatorName": "タユ, サトシ", "creatorNameLang": "ja-Kana"}], "familyNames": [{"familyName": "TAYU", "familyNameLang": "en"}, {"familyName": "田湯", "familyNameLang": "ja"}, {"familyName": "タユ", "familyNameLang": "ja-Kana"}], "givenNames": [{"givenName": "Satoshi", "givenNameLang": "en"}, {"givenName": "智", "givenNameLang": "ja"}, {"givenName": "サトシ", "givenNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "57701", "nameIdentifierScheme": "WEKO"}]}, {"creatorAffiliations": [{"affiliationNameIdentifiers": [], "affiliationNames": [{"affiliationName": "", "affiliationNameLang": "ja"}]}], "creatorNames": [{"creatorName": "UENO, Shuichi", "creatorNameLang": "en"}, {"creatorName": "上野, 修一", "creatorNameLang": "ja"}, {"creatorName": "ウエノ, シュウイチ", "creatorNameLang": "ja-Kana"}], "familyNames": [{"familyName": "UENO", "familyNameLang": "en"}, {"familyName": "上野", "familyNameLang": "ja"}, {"familyName": "ウエノ", "familyNameLang": "ja-Kana"}], "givenNames": [{"givenName": "Shuichi", "givenNameLang": "en"}, {"givenName": "修一", "givenNameLang": "ja"}, {"givenName": "シュウイチ", "givenNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "57709", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2020-06-25"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "IEICETIS_96_11_2327_2332.pdf", "filesize": [{"value": "362.1 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 362100.0, "url": {"label": "IEICETIS_96_11_2327_2332", "objectType": "fulltext", "url": "https://muroran-it.repo.nii.ac.jp/record/10264/files/IEICETIS_96_11_2327_2332.pdf"}, "version_id": "72107a87-a8f9-44c4-9828-87563a9a241d"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "3-regular graph", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "bipartite permutation graph", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "feedback vertex set", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "grid intersection graph", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "nonseparating independent set", "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": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs", "subitem_title_language": "en"}]}, "item_type_id": "79", "owner": "18", "path": ["46", "489"], "permalink_uri": "http://hdl.handle.net/10258/00010205", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2020-06-25"}, "publish_date": "2020-06-25", "publish_status": "0", "recid": "10264", "relation": {}, "relation_version_is_last": true, "title": ["On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs"], "weko_shared_id": -1}
On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs
http://hdl.handle.net/10258/00010205
http://hdl.handle.net/10258/00010205ff419170-ff04-4b96-8a26-920fcbbb1664
名前 / ファイル | ライセンス | アクション |
---|---|---|
IEICETIS_96_11_2327_2332 (362.1 kB)
|
|
Item type | 学術雑誌論文 / Journal Article.(1) | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
公開日 | 2020-06-25 | |||||||||||
タイトル | ||||||||||||
言語 | en | |||||||||||
タイトル | On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs | |||||||||||
言語 | ||||||||||||
言語 | eng | |||||||||||
キーワード | ||||||||||||
言語 | en | |||||||||||
主題Scheme | Other | |||||||||||
主題 | 3-regular graph | |||||||||||
キーワード | ||||||||||||
言語 | en | |||||||||||
主題Scheme | Other | |||||||||||
主題 | bipartite permutation graph | |||||||||||
キーワード | ||||||||||||
言語 | en | |||||||||||
主題Scheme | Other | |||||||||||
主題 | feedback vertex set | |||||||||||
キーワード | ||||||||||||
言語 | en | |||||||||||
主題Scheme | Other | |||||||||||
主題 | grid intersection graph | |||||||||||
キーワード | ||||||||||||
言語 | en | |||||||||||
主題Scheme | Other | |||||||||||
主題 | nonseparating independent set | |||||||||||
資源タイプ | ||||||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
資源タイプ | journal article | |||||||||||
アクセス権 | ||||||||||||
アクセス権 | open access | |||||||||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||||||||
著者 |
髙岡, 旭
× 髙岡, 旭
WEKO
59462
× 田湯, 智× 上野, 修一 |
|||||||||||
室蘭工業大学研究者データベースへのリンク | ||||||||||||
髙岡 旭(TAKAOKA Asahi) | ||||||||||||
http://rdsoran.muroran-it.ac.jp/html/200000242_ja.html | ||||||||||||
抄録 | ||||||||||||
内容記述タイプ | Abstract | |||||||||||
内容記述 | We consider the minimum feedback vertex set problem for some bipartite graphs and degree-constrained graphs. We show that the problem is linear time solvable for bipartite permutation graphs and NP-hard for grid intersection graphs. We also show that the problem is solvable in O(n(2) log(6) n) time for n-vertex graphs with maximum degree at most three. | |||||||||||
言語 | en | |||||||||||
書誌情報 |
en : IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 巻 E96D, 号 11, p. 2327-2332, 発行日 2013 |
|||||||||||
出版者 | ||||||||||||
言語 | en | |||||||||||
出版者 | IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG | |||||||||||
出版者版へのリンク | ||||||||||||
10.1587/transinf.E96.D.2327 | ||||||||||||
https://doi.org/10.1587/transinf.E96.D.2327 | ||||||||||||
DOI | ||||||||||||
関連タイプ | isIdenticalTo | |||||||||||
識別子タイプ | DOI | |||||||||||
関連識別子 | 10.1587/transinf.E96.D.2327 | |||||||||||
日本十進分類法 | ||||||||||||
主題Scheme | NDC | |||||||||||
主題 | 548 | |||||||||||
ISSN | ||||||||||||
収録物識別子タイプ | EISSN | |||||||||||
収録物識別子 | 1745-1361 | |||||||||||
権利 | ||||||||||||
言語 | en | |||||||||||
権利情報 | Copyright © 2013 IEICE | |||||||||||
参考URL | ||||||||||||
識別子タイプ | URI | |||||||||||
関連識別子 | https://search.ieice.org/index.html | |||||||||||
言語 | en | |||||||||||
関連名称 | IEICE Transactions Online TOP | |||||||||||
著者版フラグ | ||||||||||||
出版タイプ | VoR | |||||||||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||||||
フォーマット | ||||||||||||
内容記述タイプ | Other | |||||||||||
内容記述 | application/pdf |