Algorithm for $\mathcal{B}$-partitions, parameterized complexity of the matrix determinant and permanent

Ranveer Singh, Vivek Vijay, RB Bapat

Every square matrix $A=(a_{uv})\in {\mathcal{C}}^{n\times n}$ can be represented as a digraph having $n$ vertices. In the digraph, a block (or 2-connected component) is a maximally c…