Academic
Publications
Matrix Robustness, with an Application to Power System Observability

Matrix Robustness, with an Application to Power System Observability,Matthias Brosemann,Jochen Alber,Falk Hüffner,Rolf Niedermeier

Matrix Robustness, with an Application to Power System Observability   (Citations: 1)
BibTex | RIS | RefWorks Download
We initiate the study of the computational complexity of Matrix Robustness: Check whether deleting any k rows from a full-rank matrix does not change the matrix rank. This problem is motivated by applications in observability analysis of electrical power networks. We indicate the coNP-completeness of Matrix Robust- ness, provide linear programming based solutions (both exact and heuristic) and a problem-specific algorithm, and present encouraging experimental results.
Conference: Algorithms and Complexity in Durham - ACID , pp. 37-48, 2006
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: