{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00217353","sets":["1164:2592:10824:10900"]},"path":["10900"],"owner":"44499","recid":"217353","title":["Finding shortest non-separating and non-disconnecting paths"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-03-07"},"_buckets":{"deposit":"4567d279-9ade-47c3-bc5b-442dc81b6d4c"},"_deposit":{"id":"217353","pid":{"type":"depid","value":"217353","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Finding shortest non-separating and non-disconnecting paths","author_link":["563032","563036","563034","563035","563033","563031"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Finding shortest non-separating and non-disconnecting paths"},{"subitem_title":"Finding shortest non-separating and non-disconnecting paths","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-03-07","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Kyoto University"},{"subitem_text_value":"Kyoto University"},{"subitem_text_value":"Nagoya University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Nagoya University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/217353/files/IPSJ-AL22187005.pdf","label":"IPSJ-AL22187005.pdf"},"date":[{"dateType":"Available","dateValue":"2024-03-07"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL22187005.pdf","filesize":[{"value":"655.2 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"a64150e9-efbb-4796-b700-f385b3b0d90f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasuaki, Kobayashi"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shunsuke, Nagano"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yota, Otachi"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasuaki, Kobayashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shunsuke, Nagano","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yota, Otachi","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":"For a connected graph G = (V, E) and s, t ∈ V, a non-separating s-t path is a path P between s and t such that the set of vertices of P does not separate G, that is, G - V (P) is connected. An s-t path is non-disconnected if G - E(P) is connected. The problems of finding shortest non-separating and non-disconnecting paths are both known to be NP-hard. In this paper, we consider the problems from the viewpoint of parameterized complexity. We show that the problem of finding a non-separating s-t path of length at most k is W[1]-hard parameterized by k, while the non-disconnecting counterpart is fixed-parameter tractable parameterized by k. We also consider the shortest non-separating path problem on several classes of graphs and show that this problem is NP-hard even on bipartite graphs, chordal graphs, and planar graphs. As for positive results, the shortest non-separating path problem is fixed-parameter tractable parameterized by k on planar graphs and polynomial-time solvable on chordal graphs if k is the shortest path distance between s and t.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"For a connected graph G = (V, E) and s, t ∈ V, a non-separating s-t path is a path P between s and t such that the set of vertices of P does not separate G, that is, G - V (P) is connected. An s-t path is non-disconnected if G - E(P) is connected. The problems of finding shortest non-separating and non-disconnecting paths are both known to be NP-hard. In this paper, we consider the problems from the viewpoint of parameterized complexity. We show that the problem of finding a non-separating s-t path of length at most k is W[1]-hard parameterized by k, while the non-disconnecting counterpart is fixed-parameter tractable parameterized by k. We also consider the shortest non-separating path problem on several classes of graphs and show that this problem is NP-hard even on bipartite graphs, chordal graphs, and planar graphs. As for positive results, the shortest non-separating path problem is fixed-parameter tractable parameterized by k on planar graphs and polynomial-time solvable on chordal graphs if k is the shortest path distance between s and t.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"5","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-03-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2022-AL-187"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":217353,"updated":"2025-01-19T15:31:47.650364+00:00","links":{},"created":"2025-01-19T01:17:50.981204+00:00"}