A note on finding minimum mean cycle

DOI10.1016/J.IPL.2017.06.007zbMath1415.05062OpenAlexW2625841184MaRDI QIDQ2398498

Mmanu Chaturvedi, Ross M. McConnell

Publication date: 16 August 2017

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.06.007

zbMATH Keywords

analysis of algorithmsdesign of algorithmsgraph algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Computing the average inter-sample time of event-triggered control using quantitative automata ⋮ Computing the sampling performance of event-triggered control ⋮ ETCetera: beyond Event-Triggered Control

Cites Work

• A characterization of the minimum cycle mean in a digraph

This page was built for publication: A note on finding minimum mean cycle