Reducing rank of the adjacency matrix by graph modification
From MaRDI portal
Publication:344771
DOI10.1016/j.tcs.2016.02.020zbMath1353.05117MaRDI QIDQ344771
Saket Saurabh, Pranabendu Misra, Syed M. Meesum
Publication date: 24 November 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.020
parameterized complexity; fixed parameter tractable; edge editing; graph modification; rank of adjacency matrix; vertex deletion
68Q25: Analysis of algorithms and problem complexity
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C85: Graph algorithms (graph-theoretic aspects)