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 ...

On independent random points U1,⋯ ,Un distributed uniformly on [0,1]d, a random graph Gn(x) is constructed in which two distinct such points are joined by an edge if the l∞-distance between them is at ...