Skip to main content
Book Chapter

Finding the Maximum Strong Components in a Directed Graph

  • Dijkstra E
Springer New York, (1982), 22-30
DOI: 10.1007/978-1-4612-5695-3_3
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Dijkstra, E. W. (1982). Finding the Maximum Strong Components in a Directed Graph. In Selected Writings on Computing: A personal Perspective (pp. 22–30). Springer New York. https://doi.org/10.1007/978-1-4612-5695-3_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free