The cost-to-time ratio problem for large or infinite graphs (Q1101357): Difference between revisions

@@ Property / cites work @@
+Q3964346
@@ Property / cites work: Q3964346 / rank @@
+Normal rank
@@ Property / cites work @@
+Eigenfunctions and optimal orbits
@@ Property / cites work: Eigenfunctions and optimal orbits / rank @@
+Normal rank
@@ Property / cites work @@
+Q5583694
@@ Property / cites work: Q5583694 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
+Normal rank
@@ Property / cites work @@
+Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
+Normal rank
@@ Property / cites work @@
+Applications of shortest path algorithms to matrix scalings
+Normal rank
@@ Property / cites work @@
+A characterization of the minimum cycle mean in a digraph
+Normal rank
@@ Property / cites work @@
+Parametric shortest path algorithms with an application to cyclic staffing
+Normal rank
@@ Property / cites work @@
+Q5593809
@@ Property / cites work: Q5593809 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4050410
@@ Property / cites work: Q4050410 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization with Rational Objective Functions
+Normal rank