Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip

DOI10.1016/S0166-218X(01)00339-0zbMATH Open1014.68216MaRDI QIDQ697566FDOQ697566

Authors: Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen 

Publication date: 17 September 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Recommendations

• Maximum cycle-means of weighted digraphs
• Faster parametric shortest path and minimum‐balance algorithms
• Approximating the minimum cycle mean
• Approximating the minimum cycle mean
• Finding minimum cost to time ratio cycles with small integral transit times

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• A characterization of the minimum cycle mean in a digraph
• Max-Balancing Weighted Directed Graphs and Matrix Scaling
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Faster parametric shortest path and minimum‐balance algorithms
• Title not available (Why is that?)

This page was built for publication: Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip

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