{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00216135","sets":["1164:2592:10824:10825"]},"path":["10825"],"owner":"44499","recid":"216135","title":["Algorithms for Happy Set Problem on Interval Graphs and Permutation Graphs"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-01-20"},"_buckets":{"deposit":"7883caad-0a3a-4b57-a238-f873cd32b7d4"},"_deposit":{"id":"216135","pid":{"type":"depid","value":"216135","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Algorithms for Happy Set Problem on Interval Graphs and Permutation Graphs","author_link":["557601","557600","557602","557603","557607","557598","557604","557605","557599","557606"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Algorithms for Happy Set Problem on Interval Graphs and Permutation Graphs"},{"subitem_title":"Algorithms for Happy Set Problem on Interval Graphs and Permutation Graphs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-01-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University"},{"subitem_text_value":"School of Computer Science and Systems Engineering, Kyushu Institute of Technology"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"School of Computer Science and Systems Engineering, Kyushu Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku 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/216135/files/IPSJ-AL22186007.pdf","label":"IPSJ-AL22186007.pdf"},"date":[{"dateType":"Available","dateValue":"2024-01-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL22186007.pdf","filesize":[{"value":"693.6 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":"e839ebdd-0f4f-46c5-8489-2af9f3a052d0","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":"Hiroshi, Eto"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takehiro, Ito"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Eiji, Miyano"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Akira, Suzuki"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yuma, Tamura"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroshi, Eto","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takehiro, Ito","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Eiji, Miyano","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Akira, Suzuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yuma, Tamura","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 technical report, we investigate the complexity of the MAXIMUM HAPPY SET problem on subclasses of co-comparability graphs. For a graph G and its vertex subset S , a vertex v ∈ S is happy if all v's neighbors in G are contained in S . Given a graph G and a non-negative integer k, MAXIMUM HAPPY SET is the problem of finding a vertex subset S of G such that ","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this technical report, we investigate the complexity of the MAXIMUM HAPPY SET problem on subclasses of co-comparability graphs. For a graph G and its vertex subset S , a vertex v ∈ S is happy if all v's neighbors in G are contained in S . Given a graph G and a non-negative integer k, MAXIMUM HAPPY SET is the problem of finding a vertex subset S of G such that ","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-01-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7","bibliographicVolumeNumber":"2022-AL-186"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":216135,"updated":"2025-01-19T15:54:45.600990+00:00","links":{},"created":"2025-01-19T01:16:51.493657+00:00"}