Pages that link to "Item:Q1249587"
From MaRDI portal
The following pages link to A characterization of the minimum cycle mean in a digraph (Q1249587):
Displayed 29 items.
- Extremal eigenproblem for bivalent matrices (Q1894469) (← links)
- Maximum cycle-means of weighted digraphs (Q1920444) (← links)
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
- Linear matrix period in max-plus algebra (Q1973926) (← links)
- The power algorithm in max algebra (Q2365659) (← links)
- Computing an eigenvector of a Monge matrix in max-plus algebra (Q2474561) (← links)
- Optimal infinite scheduling for multi-priced timed automata (Q2475633) (← links)
- Structure of the eigenspace of a Monge matrix in max-plus algebra (Q2476248) (← links)
- Permuted max-algebraic eigenvector problem is \(NP\)-complete (Q2479500) (← links)
- A method for approximating symmetrically reciprocal matrices by transitive matrices (Q2484490) (← links)
- Eigenvectors of interval matrices over max--plus algebra (Q2565846) (← links)
- \(\ell\)-parametric eigenproblem in max-algebra (Q2565847) (← links)
- Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues (Q2639765) (← links)
- Cyclic schedules for r irregularity occurring events (Q2639766) (← links)
- Finding minimum cost to time ratio cycles with small integral transit times (Q3141113) (← links)
- Efficient Computation of Throughput Values of Context-Free Languages (Q3503907) (← links)
- Value Iteration (Q3512436) (← links)
- Online Regret Bounds for Markov Decision Processes with Deterministic Transitions (Q3529915) (← links)
- Elasticity and Petri Nets (Q3599221) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
- A note on weighted minimal cost flows (Q3895198) (← links)
- TheO(n3) algorithm for a special case of the maximum cost-to-time ratio cycle problem and its coherence with an eigenproblem of a matrix (Q4015964) (← links)
- On the capabilities of systolic systems (Q4277374) (← links)
- Understanding retiming through maximum average-delay cycles (Q4277377) (← links)
- Combinatorial algorithms for inverse network flow problems (Q4798190) (← links)
- Faster parametric shortest path and minimum‐balance algorithms (Q5752305) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- A simplex-like method to compute the eigenvalue of an irreducible \((\max,+)\)-system (Q5940027) (← links)
- Modifying the power method in max algebra (Q5946172) (← links)