Fully dynamic transitive closure in plane dags with one source and one sink.pdf

下载文档

9
0
约4.99万字
约 29页
2017-04-09 发布于江苏
举报
版权申诉
保障服务

Fully dynamic transitive closure in plane dags with one source and one sink.pdf

1、本文档共29页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

Fully dynamic transitive closure in plane dags with one source and one sink

B R I C S R S - 9 4 - 3 0 T . H u s f e l d t : F u lly D y n a m ic T r a n s i t iv e C lo s u r e i n P la n e D a g s BRICS Basic Research in Computer Science Fully Dynamic Transitive Closure in Plane Dags with one Source and one Sink Thore Husfeldt BRICS Report Series RS-94-30 ISSN 0909-0878 September 1994 Copyright c? 1994, BRICS, Department of Computer Science University of Aarhus. All rights reserved. Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS Department of Computer Science University of Aarhus Ny Munkegade, building 540 DK - 8000 Aarhus C Denmark Telephone: +45 8942 3360 Telefax: +45 8942 3255 Internet: BRICS@brics.dk BRICS publications are in general accessible through WWW and anonymous FTP: http://www.brics.dk/ ftp ftp.brics.dk (cd pub/BRICS) FULLY DYNAMIC TRANSITIVE CLOSURE IN PLANE DAGS WITH ONE SOURCE AND ONE SINK THORE HUSFELDT BRICS? Department of Computer Science, University of Aarhus Ny Munkegade, DK-???? A?rhus C, Denmark 27th September 1994 Abstract. We give an algorithm for the Dynamic Transitive Clo- sure Problem for planar directed acyclic graphs with one source and one sink. The graph can be updated in logarithmic time under arbitrary edge insertions and deletions that preserve the embedding. Queries of the form ‘is there a directed path from u to v?’ for arbitrary vertices u and v can be answered in loga- rithmic time. The size of the data structure and the initialisation time are linear in the number of edges. The result enlarges the class of graphs for which a logarithmic (or even polylogarithmic) time dynamic transitive closure algo- rithm exists. Previously, the only algorithms within the stated resource bounds put restrictions on the topology of the graph or on the delete operation. To obtain our result, we