directed hypergraphs algorithms and applications - Free

Let H = be a weighted hypergraph
An inductively defined measure µ over a weighted directed
hypergraph is characterized by a triple µ = (µ 0, ψ, f) where:
µ 0 : measure of an empty hyperpath (normally equal to zero)
ψ : combination of costs on the source set
f : composition of ψ and w
and is defined as follows:
µ (∅) = µ 0
µ (h Z, t) = f (w X,t, ψ (µ(h Z, x1), µ(h Z, x2), …, µ(h Z, xn)) if h Z, t is
the hyperpath: (Z, x 1), (Z, x 2), …, (Z, x n), (X, t) and X = {x 1,
x 2, …, x n}