Graph algorithms and spanners have emerged as a critical area of research in computer science, underpinning both theoretical advances and practical applications such as network design, routing ...

Refining with colors Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.

Several interesting problems in multirobot systems can be cast in the framework of distributed optimization. Examples include multirobot task allocation, vehicle routing, target protection, and ...