"An Optimal Algorithm for the Period of a Strongly Connected Digraph."

Adriano Pascoletti (1992)

Details and statistics

DOI: 10.1016/0020-0190(92)90106-6

access: closed

type: Journal Article

metadata version: 2017-05-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics