When solving a system of equations, it can be beneficial not to solve it in its entirety at once, but rather to decompose it into smaller subsystems that can be solved in order. Based on a bisimplicial graph representation we analyze the parameterized complexity of two problems central to such a decomposition: The Free Square Block problem related to finding smallest subsystems that can be solved separately, and the Bounded Block Decomposition problem related to determining a decomposition where the largest subsystem is as small as possible. We show both problems to be W-hard. Finally we relate these problems to crown structures and settle two open questions regarding them using our results.
|Name||Memorandum / Department of Applied Mathematics|
|Publisher||Department of Applied Mathematics, University of Twente|
- Bipartite graph
- Parameterized complexity