Graph partitioning and bisection problems occupy a central position in combinatorial optimisation and theoretical computer science. These issues involve dividing a graph’s vertex set into distinct ...

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

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

From powering search engines to securing data and optimizing networks, algorithms underpin nearly every aspect of modern technology. Understanding how efficiently they can solve problems — and where ...