{"updated":"2025-01-19T23:45:49.011990+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00193956","sets":["1164:2592:9674:9675"]},"path":["9675"],"owner":"44499","recid":"193956","title":["An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Graphs"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-01-22"},"_buckets":{"deposit":"f7649f73-f11b-47a3-82d8-316c1e1318ff"},"_deposit":{"id":"193956","pid":{"type":"depid","value":"193956","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Graphs","author_link":["455637","455635","455631","455634","455630","455632","455636","455633"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Graphs"},{"subitem_title":"An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Graphs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2019-01-22","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Hokkaido University"},{"subitem_text_value":"National Institute of Informatics"},{"subitem_text_value":"National Institute of Informatics"},{"subitem_text_value":"Hokkaido University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Informatics","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Informatics","subitem_text_language":"en"},{"subitem_text_value":"Hokkaido 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/193956/files/IPSJ-AL19171009.pdf","label":"IPSJ-AL19171009.pdf"},"date":[{"dateType":"Available","dateValue":"2021-01-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL19171009.pdf","filesize":[{"value":"1.3 MB"}],"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":"86ee7460-7f09-4c74-8b4c-f1c51e565ccd","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2019 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuhiro, Kurita"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kunihiro, Wasa"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takeaki, Uno"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroki, Arimura"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuhiro, Kurita","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kunihiro, Wasa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takeaki, Uno","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroki, Arimura","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":"In this paper, we propose a characterization of chordal bipartite graphs and an efficient enumeration algorithm for chordal bipartite induced subgraphs. A chordal bipartite graph is a bipartite graph without induced cycles with length six or more. It is known that chordal bipartite graphs have several characterizations. One of them is as follows: A bipartite graph B is chordal bipartite if and only if a hypergraph corresponding to B is β-acyclic. By using the characterization of β-acyclic hypergraphs, we show that a graph is chordal bipartite if and only if it has a special vertex elimination ordering. We call this vertex ordering chordal bipartite elimination ordering (CBEO). Moreover, we propose an algorithm ECB which enumerates all chordal bipartite induced subgraphs in O (ktΔ²) time per solution, where, k is the degeneracy, t is the maximum size of Kt,t as a subgraph, and Δ is the degree.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we propose a characterization of chordal bipartite graphs and an efficient enumeration algorithm for chordal bipartite induced subgraphs. A chordal bipartite graph is a bipartite graph without induced cycles with length six or more. It is known that chordal bipartite graphs have several characterizations. One of them is as follows: A bipartite graph B is chordal bipartite if and only if a hypergraph corresponding to B is β-acyclic. By using the characterization of β-acyclic hypergraphs, we show that a graph is chordal bipartite if and only if it has a special vertex elimination ordering. We call this vertex ordering chordal bipartite elimination ordering (CBEO). Moreover, we propose an algorithm ECB which enumerates all chordal bipartite induced subgraphs in O (ktΔ²) time per solution, where, k is the degeneracy, t is the maximum size of Kt,t as a subgraph, and Δ is the degree.","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":"2019-01-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"2019-AL-171"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T00:59:05.382195+00:00","id":193956,"links":{}}