For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...