On finding all unilaterally connected components of a digraph
- 1 May 1976
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 5 (1), 8-10
- https://doi.org/10.1016/0020-0190(76)90093-4
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Depth-first search and linear graph algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971
- On cliques in graphsIsrael Journal of Mathematics, 1965