An optimal algorithm for the period of a strongly connected digraph

DOI10.1016/0020-0190(92)90106-6MaRDI QIDQ1209368zbMATH OpenOpenAlexFDO

Authors 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

breadth-first searchperiodstrongly connected digraphsirreducible matricessingle-source shortest paths

Mathematics Subject Classification ID

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

Recommendations

• Computing matrix period in max--min algebra
• Matrix period in max-algebra
• Maximum cycle-means of weighted digraphs
• Circuit bases of strongly connected digraphs
• Periodic dynamic graphs. Random walks problem and the shortest path

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3760340 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3532286 (Why is no real title available?)
• scientific article; zbMATH DE number 3225772 (Why is no real title available?)
• scientific article; zbMATH DE number 3236503 (Why is no real title available?)
• scientific article; zbMATH DE number 3283153 (Why is no real title available?)
• Cell-to-cell mapping. A method of global analysis for nonlinear systems
• Efficiency of a Good But Not Linear Set Union Algorithm
• Faster algorithms for the shortest path problem
• Non-negative matrices and Markov chains. 2nd ed

Cited in

(2)

• Connected components and minimum paths
• An Optimal Lower Bound for the Size of Periodic Digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209368)