Pages that link to "Item:Q2253203"
From MaRDI portal
The following pages link to Approximating the minimum cycle mean (Q2253203):
Displaying 12 items.
- Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip (Q697566) (← links)
- Computing the throughput of concatenation state machines (Q954952) (← links)
- Minimum mean cycle problem in bidirected and skew-symmetric graphs (Q1013299) (← links)
- Algorithms for finding the minimum cycle mean in the weighted directed graph (Q1279899) (← links)
- Approximate binary search algorithms for mean cuts and cycles (Q1319679) (← links)
- Maximum cycle-means of weighted digraphs (Q1920444) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- A note on finding minimum mean cycle (Q2398498) (← links)
- Optimization of mean values on oriented graphs. Paper from the 29th Brazilian mathematics colloquium -- 29\(^{\text o}\) Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 22 -- August 2, 2013 (Q2848165) (← links)
- (Q3507834) (← links)
- Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory (Q5097012) (← links)
