{"created":"2025-01-18T22:49:29.657463+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00016139","sets":["581:906:908"]},"path":["908"],"owner":"1","recid":"16139","title":["すべての2点間径路パターンの生成と数え上げ"],"pubdate":{"attribute_name":"公開日","attribute_value":"1982-09-15"},"_buckets":{"deposit":"006c7913-4da2-4c06-b7a0-4073da41b729"},"_deposit":{"id":"16139","pid":{"type":"depid","value":"16139","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"すべての2点間径路パターンの生成と数え上げ","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"すべての2点間径路パターンの生成と数え上げ"},{"subitem_title":"Generating and Counting All Possible Patterns for Routes between Two Points","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ショートノート","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1982-09-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪電気通信大学工学部応用電子工学科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Applied Electronic Engineering, Faculty of Engineering, Osaka Electro - Communication University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/16139/files/IPSJ-JNL2305016.pdf"},"date":[{"dateType":"Available","dateValue":"1984-09-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL2305016.pdf","filesize":[{"value":"219.7 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"d4afb2a7-5539-4c63-a263-4568737f9c8e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1982 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"浅野, 哲夫"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tetsuo, Asano","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"プリント基板等の配線設計においては 指定された2点間の径路探索が最も基本的な問題である.パターン限定法は あらかじめ用意された2点間径路のパターンを順に調べて径路を求める方法である.実際には径路の折れ曲り回数(ビア数)には制限が加えられることが多いので ビア数がある値以下の径路のパターンをすべて用意しておけば この方法により存在する径路は必ず見つけうる.そのようなパターンを数え上げるために 各線分の方向を示す四つの記号から成る記号列によってパターンを表現し ある記号列が有効なパターンを表すための条件を求めた.さらに ビア数nの径路を表現するパターンの個数を求める式を導いた.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"578","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"576","bibliographicIssueDates":{"bibliographicIssueDate":"1982-09-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"23"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"links":{},"id":16139,"updated":"2025-01-23T00:00:51.003561+00:00"}