Open Access
Subscription Access
Dynamic Transitive Closure Problems on Directed Graphs
In this paper we survey the newest results for dynamic problems on directed graphs. In particular, we focus on the most fundamental problem, transitive closure. These problems play a crucial role in many applications, including network optimization and routing, traffic information systems, data bases, compilers.
Keywords
Transitive closure, directed graphs
User
Font Size
Information
Abstract Views: 122
PDF Views: 2