directed hypergraphs algorithms and applications - Free

More documents

Recommendations

Info

Algorithm 1 computes all shortest distances from source set S in time O(|H| log |N| + |H |). Cost can be reduced to O(|N| log |N| + |H |) by making use of Fibonacci heaps for implementing the priority queue.
Algorithm 1 can be applied to minimization of measures based on superior functions. It can be easily extended to deal with maximization of measures based on inferior functions. See also Martelli, Montanari 1973: computation of traversal cost in <strong>and</strong>-or graphs.
Page 1 and 2: DIRECTED HYPERGRAPHS ALGORITHMS AND
Page 3 and 4: Shortest Hyperpath Problems The fol
Page 5 and 6: Measuring hyperpaths On directed hy
Page 7 and 8: Left Hyperpath Gap=3 Rank=4 Gap and
Page 9 and 10: An example of the folded an unfolde
Page 11 and 12: Example. In the most intuitive case
Page 13 and 14: Threshold: t = (0, max, max) t (∅
Page 15 and 16: The most general formulation of (si
Page 17 and 18: Generalization: Bellman-Ford equati
Page 19 and 20: Functional directed hypergraph H F
Page 21 and 22: Minimization of superior context fr
Page 23 and 24: Weakly superior functions (WSUP): g
Page 25 and 26: In the following we will see how (a
Page 27: Algorithm 1 - Let H = be a directe
Page 31 and 32: In the previous example we have the
Page 33 and 34: Note that in this case convergence
Page 35 and 36: Algorithm 2 computes all shortest d
Page 37: Essential references • Ausiello,

directed hypergraphs algorithms and applications - Free

Create successful ePaper yourself

Delete template?

Save as template?