{"created":"2021-03-01T07:09:46.567272+00:00","id":48955,"links":{},"metadata":{"_buckets":{"deposit":"05d1dac2-9ae4-460b-b5aa-ad0b37734a70"},"_deposit":{"id":"48955","owners":[],"pid":{"revision_id":0,"type":"depid","value":"48955"},"status":"published"},"_oai":{"id":"oai:repository.dl.itc.u-tokyo.ac.jp:00048955","sets":["34:95:96","9:10:15"]},"item_2_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1997-04-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicPageEnd":"688","bibliographicPageStart":"682","bibliographicVolumeNumber":"E80-A","bibliographic_titles":[{"bibliographic_title":"IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences"}]}]},"item_2_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"This paper proposes a unified approach by means of the binary decision diagram, BDD in short, to solve #P-hand problems of counting the number of paths between two terminals in undirected and directed graphs. Our approach provides algorithms running in O (2O (√n) ) time for typical planar graphs such as grid graphs. In fact, for any class of graphs having a good elimination ordering, this paradigm provides efficient solutions.","subitem_description_type":"Abstract"}]},"item_2_description_6":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)","subitem_description_type":"Other"}]},"item_2_publisher_20":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Institute of Electronics, Information and Communication Engineers"}]},"item_2_relation_25":{"attribute_name":"関係URI","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://search.ieice.org/","subitem_relation_type_select":"URI"}}]},"item_2_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"copyright©1997 IEICE"}]},"item_2_select_14":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"publisher"}]},"item_2_text_4":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Information Science, University of Tokyo"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"SEKINE, Kyoko"}],"nameIdentifiers":[{"nameIdentifier":"145473","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"IMAI, Hiroshi"}],"nameIdentifiers":[{"nameIdentifier":"145474","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-12-15"}],"displaytype":"detail","filename":"Counting the Number of Paths in a Graph via BDDs 1997.pdf","filesize":[{"value":"635.5 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"Counting the Number of Paths in a Graph via BDDs 1997.pdf","url":"https://repository.dl.itc.u-tokyo.ac.jp/record/48955/files/Counting the Number of Paths in a Graph via BDDs 1997.pdf"},"version_id":"eb3c28ad-45e8-47ba-8cb8-55cf447df745"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Counting the Number of Paths in a Graph via BDDs","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Counting the Number of Paths in a Graph via BDDs"}]},"item_type_id":"2","owner":"1","path":["15","96"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-12-14"},"publish_date":"2017-12-14","publish_status":"0","recid":"48955","relation_version_is_last":true,"title":["Counting the Number of Paths in a Graph via BDDs"],"weko_creator_id":"1","weko_shared_id":null},"updated":"2022-12-19T04:23:35.562529+00:00"}