{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00130170","sets":["6504:8117:8119"]},"path":["8119"],"owner":"1","recid":"130170","title":["A Method to Calculate Legal Sequence Number for Extended Series-Parallel Digraphs"],"pubdate":{"attribute_name":"公開日","attribute_value":"1996-09-04"},"_buckets":{"deposit":"81d631d5-fc10-4c91-8098-519869e69146"},"_deposit":{"id":"130170","pid":{"type":"depid","value":"130170","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"A Method to Calculate Legal Sequence Number for Extended Series-Parallel Digraphs","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Method to Calculate Legal Sequence Number for Extended Series-Parallel Digraphs","subitem_title_language":"en"}]},"item_type_id":"22","publish_date":"1996-09-04","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"山口大"},{"subitem_text_value":"山口大"}]},"item_22_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Education, Yamaguchi University, Japan","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Education, Yamaguchi University, Japan","subitem_text_language":"en"}]},"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/130170/files/KJ00001341925.pdf"},"date":[{"dateType":"Available","dateValue":"1996-09-04"}],"format":"application/pdf","filename":"KJ00001341925.pdf","filesize":[{"value":"194.4 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"0a4eb7bd-0930-4d9d-8ed4-e257d733c19b","displaytype":"detail","licensetype":"license_note"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The problem of topological sorting is, given with a directed acyclic graph G=(V, E), to find a total ordering of the vertices such that if (u, v)∈E then u is ordered before v. Instead of finding total orderings, we wish to find out how many total orderings exist in a given directed acyclic graph G=(V, E). We call a total ordering of the vertices as legal sequence and the problem as LSN(legal sequence number) problem. In this paper we study how to calculate LSN for a given directed acyclic graph G=(V, E). First we give the fundamental theorems for calculating LSN of general directed acyclic graphs. Then we give a way to calculate LSN for series-parallel digraphs and methods to transform a class of extended series-parallel digraphs into series-parallel ones. Finally we calculate LSN for the class of graphs, which are extended from series-parallel digraphs by adding so called bridge edges and bridge-path between specific paths.","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"158","bibliographic_titles":[{"bibliographic_title":"全国大会講演論文集"}],"bibliographicPageStart":"157","bibliographicIssueDates":{"bibliographicIssueDate":"1996-09-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"ソフトウェア科学・工学","bibliographicVolumeNumber":"第53回"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"updated":"2025-01-21T00:15:01.627399+00:00","created":"2025-01-19T00:09:16.541142+00:00","id":130170}