On the Complexity of Recovering Incidence Matrices

DOI10.4230/LIPIcs.ESA.2020.50OpenAlexW3082323976MaRDI QIDQ5874520

Petr A. Golovach, Fedor V. Fomin, Pranabendu Misra, M. S. Ramanujan

Publication date: 7 February 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12916/pdf/LIPIcs-ESA-2020-50.pdf/

zbMATH Keywords

matrix recoveryenumeration algorithmgraph incidence matrix

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Computing girth and cogirth in perturbed graphic matroids
• On Rota's conjecture and excluded minors containing large projective geometries.
• Robust principal component analysis?
• Rank-Sparsity Incoherence for Matrix Decomposition
• Deterministic Truncation of Linear Matroids
• Exact and Approximation Algorithms for Weighted Matroid Intersection

This page was built for publication: On the Complexity of Recovering Incidence Matrices