Complexity and Algorithms in Graphs

Graphs—collections of nodes connected by edges—turn up wherever relationships matter: road networks, circuit layouts, social connections, supply chains. The central challenge is figuring out how efficiently a computer can answer questions about these structures, such as finding the shortest route, the maximum flow through a network, or the best way to partition nodes into groups, while also pinning down which problems are fundamentally hard and which admit clever shortcuts called approximation algorithms. Techniques from linear programming, submodular optimization, and matrix multiplication have recently sharpened both upper and lower bounds, revealing surprising connections between seemingly unrelated problems. Key open questions include whether the best-known approximation ratios for problems like Traveling Salesman or Densest Subgraph can be improved, and exactly how much communication is required when computation is distributed across multiple parties—a question with direct implications for the design of large-scale parallel systems.

Works

39,262

Total citations

540,365

Keywords

Combinatorial OptimizationApproximation AlgorithmsComplexity TheoryGraph AlgorithmsSubmodular FunctionsNetwork Flows