A Scalable, Memory-Efficient Algorithm for Minimum Cycle Mean Calculation in Directed Graphs
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"
DOI: 10.1109/tcad.2021.3097300
Abstract: The concept of minimum cycle mean (MCM) in a directed graph has many applications in the design of circuits and systems. The algorithm by Young, Tarjan, and Orlin (YTO), when implemented with a binary heap,… read more here.
Keywords: cycle mean; karp algorithm; runtime performance; minimum cycle ... See more keywords