In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...