On the Complexity of Recovering Incidence Matrices

DOI10.4230/LIPICS.ESA.2020.50OpenAlexW3082323976MaRDI QIDQ5874520FDOQ5874520

Authors: Fedor V. Fomin, Petr A. Golovach, 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

• Robust principal component analysis?
• Rank-Sparsity Incoherence for Matrix Decomposition
• Title not available (Why is that?)
• Exact and approximation algorithms for weighted matroid intersection
• On Rota's conjecture and excluded minors containing large projective geometries.
• Computing girth and cogirth in perturbed graphic matroids

Cited In (2)

• Rank of incidence matrix with applications to digraph reconstruction
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874520)