{"links":{},"id":174612,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00174612","sets":["1164:2592:8452:8903"]},"path":["8903"],"owner":"11","recid":"174612","title":["単純<i>b</i>-マッチングのDulmage-Mendelsohn分解"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-09-16"},"_buckets":{"deposit":"1badde2a-2e0c-4d97-b424-70ccbb1807bc"},"_deposit":{"id":"174612","pid":{"type":"depid","value":"174612","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"単純<i>b</i>-マッチングのDulmage-Mendelsohn分解","author_link":["360216","360217"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"単純<i>b</i>-マッチングのDulmage-Mendelsohn分解"},{"subitem_title":"Dulmage-Mendelsohn Decomoposition for Simple b-Matchings","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2016-09-16","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"国立情報学研究所"}]},"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/174612/files/IPSJ-AL16159005.pdf","label":"IPSJ-AL16159005.pdf"},"date":[{"dateType":"Available","dateValue":"2018-09-16"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL16159005.pdf","filesize":[{"value":"491.0 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":"051c43b1-d2f6-4dd2-83e4-80c5014c3dd6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2016 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"喜多, 奈々緒"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Nanao, Kita","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":"マッチング理論においては総称して標準分解と呼ばれるいくつかの分解型構造定理が強力な道具となるが，古典的な Dulmage - Mendelsoh 分解とは 2 部グラフを対象する標準分解のひとつであり，与えられた 2 部グラフが持つ標準的な束構造を通して全ての最大 1 - マッチングとその双対最適解である最小点被覆の族の構造を記述する．これはグラフ理論的文脈のみならず，大規模疎行列による連立方程式の効率的解法など行列計算の分野への応用が報告されている他，基本分割理論の原型を与えるなど劣モジュラ関数論への貢献が知られている．一方，b - マッチングもまた古典的な概念でありこれは 1 - マッチングの代表的な一般化である．本研究ではDulmage - Mendelsohn 分解を b - マッチングを対象にするものへと一般化を与え，古典的な成果と同様，2 部グラフの半順序構造の抽出ひいて最大 b - マッチングおよび双対最適解の構造を記述する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"3","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2016-09-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2016-AL-159"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-19T00:44:46.869293+00:00","updated":"2025-01-20T06:37:49.094787+00:00"}