On the vector representation of the reachability in planar directed graphs
- 1 January 1975
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 3 (3) , 75-77
- https://doi.org/10.1016/0020-0190(75)90019-8
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Efficient determination of the transitive closure of a directed graphInformation Processing Letters, 1971
- A transitive closure algorithmBIT Numerical Mathematics, 1970
- Some Theorems and Procedures for Loop-Free Routing in Directed Communication NetworksBell System Technical Journal, 1968