A correction to a unilaterally connected components algorithm
- 1 February 1978
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 7 (2) , 125
- https://doi.org/10.1016/0020-0190(78)90058-3
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On finding all unilaterally connected components of a digraphInformation Processing Letters, 1976
- Some related problems from network flows, game theory and integer programmingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972
- An Algorithm for Finding a Minimum Equivalent Graph of a DigraphJournal of the ACM, 1969