Maximal strong components : an exercise in program presentation

F.E.J. Kruseman Aretz

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic


Tarjan’s algorithm for the computation of the maximal strong components in a directed graph is presented. The presentation is compared to some older ones. key words: program presentation, Tarjan’s algorithm, maximal strong components.
Original languageEnglish
Title of host publicationBeauty is our business : a birthday salute to Edsger W. Dijkstra
EditorsW.H.J. Feijen, A.J.M. Gasteren, van, D. Gries, J. Misra
Place of PublicationBerlin
ISBN (Print)0-387-97299-4
Publication statusPublished - 1990

Publication series

NameTexts and monographs in computer science
ISSN (Print)0172-603X


Dive into the research topics of 'Maximal strong components : an exercise in program presentation'. Together they form a unique fingerprint.

Cite this