7 search results - page 2 / 2 » Minimum Cost Homomorphism Dichotomy for Oriented Cycles |
DAM
2008
13 years 5 months ago
2008
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). For a fixed directed or undirected graph H and an input graph D, the...
DAM
1999
13 years 5 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...