AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

Improved Dynamic Reachability Algorithms for Directed Graphs

SIAM J. Comput., no. 5 (2008): 1455-1471

被引用77|浏览23
EI
下载 PDF 全文
引用

摘要

We obtain several new dynamic algorithms for maintaining the transitive closure of a directed graph and several other algorithms for answering reachability queries without explicitly maintaining a transitive closure matrix. Among our algorithms are: (i) A decremental algorithm for maintaining the transitive closure of a directed graph, th...更多

代码

数据

您的评分 :
0

 

标签
评论
小科