{"created":"2025-01-19T00:21:58.122246+00:00","updated":"2025-01-20T17:56:15.063704+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00146513","sets":["1164:2735:7896:8400"]},"path":["8400"],"owner":"11","recid":"146513","title":["大規模グラフにおける擬似クリーク厳密解全列挙に関する考察"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-12-08"},"_buckets":{"deposit":"6014e448-2be8-4769-a301-84fcc28ceb3d"},"_deposit":{"id":"146513","pid":{"type":"depid","value":"146513","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"大規模グラフにおける擬似クリーク厳密解全列挙に関する考察","author_link":["228969","228971","228970","228972"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"大規模グラフにおける擬似クリーク厳密解全列挙に関する考察"}]},"item_type_id":"4","publish_date":"2015-12-08","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"北海道大学大学院情報科学研究科"},{"subitem_text_value":"北海道大学大学院情報科学研究科"},{"subitem_text_value":"北海道大学大学院情報科学研究科"},{"subitem_text_value":"電気通信大学先進アルゴリズム研究ステーション"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Advanced Algorithms Research Laboratory, The University of Electro-Communications","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/146513/files/IPSJ-MPS15106006.pdf","label":"IPSJ-MPS15106006.pdf"},"date":[{"dateType":"Available","dateValue":"2017-12-08"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS15106006.pdf","filesize":[{"value":"985.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":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"3c0e22c3-baf6-4b3c-ae3e-d82a6ae1c5bd","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2015 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"大久保, 好章"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"ジェイ, 泓杰"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"原口, 誠"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"富田, 悦次"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","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-8833","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本報告では，著者等が先に提案した，所与のグラフにおける擬似クリークの全列挙問題に対する高速アルゴリズムの有効性を実験的に検証する．抽出対象とする擬似クリークは，それを構成する各頂点毎に非隣接上限数を定めた k-Plex モデルに対し，十分な密度を保証するための隣接下限数を新たな制約として課した j- 核性 k-Plex であり，j- 核計算の単調性を利用することで，探索処理における不要な探索枝の展開が強力に抑制される．実験では，80 万超頂点のウェブグラフを含むネットワークに対して，最新の極大 k-Plex 列挙システムとの比較を行い，計算時間と解の品質の観点から本システムの有効性を確認する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2015-12-08","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"2015-MPS-106"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":146513,"links":{}}