This is a preview. Log in through your library . Abstract We consider a planning problem that generalizes Alcuin's river crossing problem to scenarios with arbitrary conflict graphs. This ...
Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback