A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms
We introduce the concept of a k-dimensional matrix product D of k matrices (Formula presented.) of sizes (Formula presented.) respectively, where (Formula presented.) is equal to (Formula presented.). We provide upper bounds on the time complexity of computing the product and solving related problems of computing witnesses and maximum witnesses of the Boolean version of the product in terms of the
