"On Finding the Strongly Connected Components in a Directed Graph."

Esko Nuutila, Eljas Soisalon-Soininen (1994)

Details and statistics

DOI: 10.1016/0020-0190(94)90047-7

access: closed

type: Journal Article

metadata version: 2018-11-14

a service of  Schloss Dagstuhl - Leibniz Center for Informatics