On the Vector Representation of the Reachability in Planar Directed Graphs
暂无分享,去创建一个
[1] Paul Walton Purdom,et al. A transitive closure algorithm , 1970, BIT.
[2] R. Magnani. Some theorems and procedures for loop-free routing in directed communication networks , 1968 .
[3] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[4] J. Ian Munro,et al. Efficient Determination of the Transitive Closure of a Directed Graph , 1971, Inf. Process. Lett..
[5] Frank Harary,et al. Graph Theory , 2016 .