On Finding the Strongly Connected Components in a Directed Graph

Research output: Contribution to journalArticleScientificpeer-review

Researchers

Research units

Details

Original languageEnglish
Pages (from-to)9-14
JournalInformation Processing Letters
Volume49
Publication statusPublished - 1994
MoE publication typeA1 Journal article-refereed

    Research areas

  • design of algorithms, strongly connected components, tarjan's algorithm

ID: 4873888