Computing the throughput of concatenation state machines (Q954952): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2007.04.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2071925009
@@ Property / OpenAlex ID: W2071925009 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of the minimum cycle mean in a digraph
+Normal rank
@@ Property / cites work @@
+Finding minimum cost to time ratio cycles with small integral transit times
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization with Rational Objective Functions
+Normal rank
@@ Property / cites work @@
+Faster parametric shortest path and minimum‐balance algorithms
+Normal rank
@@ Property / cites work @@
+New scaling algorithms for the assignment and minimum mean cycle problems
+Normal rank
@@ Property / cites work @@
+Dynamic Programming as Graph Searching: An Algebraic Approach
+Normal rank
@@ Property / cites work @@
+Generalized AND/OR graphs
@@ Property / cites work: Generalized AND/OR graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3856120
@@ Property / cites work: Q3856120 / rank @@
+Normal rank
@@ Property / cites work @@
+Directed hypergraphs and applications
@@ Property / cites work: Directed hypergraphs and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the \(K\) shortest hyperpaths
@@ Property / cites work: Finding the \(K\) shortest hyperpaths / rank @@
+Normal rank
@@ Property / cites work @@
+Implementation and Application of Automata
@@ Property / cites work: Implementation and Application of Automata / rank @@
+Normal rank