New algorithm speed for structural graph theory problems

Researchers show that certain problems can be solved in O~(nω)\tilde{\mathcal{O}}(n^\omega) time.

Researchers resolved a question that remained open for over 20 years. They showed that all studied problems admit an O~(nω)\tilde{\mathcal{O}}(n^\omega) time algorithm.

Kratsch and Spinrad studied several important problems in structural graph theory in SODA 2003 and SIAM Journal on Computing 2006. These problems include Asteroidal Triples and Friends.

Structural graph theory involves studying problems related to the structure of graphs. The matrix multiplication exponent is denoted as ω<2.371177\omega < 2.371177.

Previously, an intermediate running time of O~(n(3+ω)/2)\tilde{\mathcal{O}}(n^{(3+\omega)/2}) was known for these problems. It was unclear if this intermediate running time was necessary or if the hardness evidence from Kratsch and Spinrad was tight.

The new work shows the hardness evidence is tight. The authors also made partial algorithmic progress on other problems of intermediate complexity.

Key facts

  • All studied problems admit an O~(nω)\tilde{\mathcal{O}}(n^\omega) time algorithm.
  • The research resolves a question open for over 20 years.
  • The work improves on previous work by Chiu and Lu in STACS 2022 and Information and Computation 2024 and by Spinrad in Discrete Applied Math 2004.

All sections

Edition