Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

This is a preview. Log in through your library . Abstract A non-backtracking walk on a graph, H, is a directed path of directed edges of H such that no edge is the inverse of its preceding edge.

Colour quantization, the process of reducing the number of distinct colours in an image while maintaining visual fidelity, is a cornerstone of digital image processing and computer graphics. Rooted in ...