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

Distributed algorithms for graph problems represent a vibrant area of study that addresses the challenges of decentralised computation across interconnected networks. By partitioning complex graph ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

In 1986, then-Fort Wayne Mayor Win Moses Jr. proclaimed March 10-15 to be Fort Wayne Graph Theory Week and urged “all citizens, community organizations, scholars, and conference participants, to join ...