Efficient Algorithms for Graph Problems Parameterized by Vertex Integrity Using Fast Matrix Multiplication
The author presents efficient algorithms for graph problems parameterized by vertex integrity using fast matrix multiplication, demonstrating improved computational complexity.