An optimal algorithm for the period of a strongly connected digraph

DOI10.1016/0020-0190(92)90106-6zbMath0768.68056OpenAlexW2059629137MaRDI QIDQ1209368

Adriano Pascoletti

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90106-6

zbMATH Keywords

strongly connected digraphsperiodbreadth-first searchirreducible matricessingle-source shortest paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Cell-to-cell mapping. A method of global analysis for nonlinear systems
• Non-negative matrices and Markov chains. 2nd ed
• Faster algorithms for the shortest path problem
• Efficiency of a Good But Not Linear Set Union Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal algorithm for the period of a strongly connected digraph