{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220140","sets":["1164:2592:10824:11000"]},"path":["11000"],"owner":"44499","recid":"220140","title":["直並列グラフに含まれる極小誘導シュタイナー部分グラフの効率良い列挙に向けて"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-09-08"},"_buckets":{"deposit":"2280b506-733f-4df2-8401-efa60565d5e3"},"_deposit":{"id":"220140","pid":{"type":"depid","value":"220140","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"直並列グラフに含まれる極小誘導シュタイナー部分グラフの効率良い列挙に向けて","author_link":["575141","575140","575142","575143"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"直並列グラフに含まれる極小誘導シュタイナー部分グラフの効率良い列挙に向けて"},{"subitem_title":"Toward Efficiency Enumeration of Minimal Induced Steiner Subgraphs in Series-Parallel Graphs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-09-08","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"豊橋技術科学大学大学院工学研究科"},{"subitem_text_value":"法政大学理工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Computer Science and Engineering, Toyohashi University of Technology","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Science and Engineering, Hosei University","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/220140/files/IPSJ-AL22189002.pdf","label":"IPSJ-AL22189002.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL22189002.pdf","filesize":[{"value":"941.5 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"e9c5fb5b-1b72-4010-a717-403bdf68fe66","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"大野木, 駿"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"和佐, 州洋"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shun, Onogi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kunihiro, Wasa","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"グラフ ???? = (???? , ????) とターミナル集合 ???? ⊆ ???? が与えられる．頂点集合 ???? ⊇ ???? によって誘導される部分グラフ ???? [????] が連結であるとき，????[????] は ISS であるという．S の任意の真部分集合 ????，に対して ???? [????] が ISS でないとき，???? [????] は MISS であるという．本研究では，入力グラフに含まれる MISS を漏れなく重複なく出力する列挙問題を考察した．本問題は，入力をスプリットグラフに制限しても難しいことが知られている [Conte et al., MFCS 2019]．本研究の主結果として，入力を直並列グラフに制限し，耳分解を利用して，解の集合がどのような構造をしているか詳細に解析した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Given a graph ???? = (???? , ????) with a terminal set ???? ⊆ ???? , a vertex subset ???? ⊆ ???? is an induced Steiner subgraph (ISS) if ???? [????] is connected and ???? ⊆ ????. Additionally, we say ???? is a minimal induced Steiner subgraph (MISS) if there is no proper subset ????, of ???? such that ???? [????,] is an ISS. In this paper, we consider an enumeration problem of MISSs in a graph. The task is to output all MISS in a graph without duplicates. This problem is known to be as hard as minimal hypergraph transversal enumeration even if we restrict inputs to split graphs[Conte et al., MFCS 2019]. As the main result of this paper, we give a detailed analysis of solution sets of MISSs in series-paralle graphs by using an ear decomsition of an input graph.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-09-08","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"2022-AL-189"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":220140,"updated":"2025-01-19T14:39:18.010482+00:00","links":{},"created":"2025-01-19T01:20:11.259748+00:00"}