Rank Reduction of Directed Graphs by Vertex and Edge Deletions

DOI10.1007/978-3-662-49529-2_46zbMath1392.68329OpenAlexW2475663589MaRDI QIDQ2802973

Saket Saurabh, Syed M. Meesum

Publication date: 3 May 2016

Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49529-2_46

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Parameterized low-rank binary matrix approximation ⋮ Parameterized Low-Rank Binary Matrix Approximation ⋮ Matrix Rigidity from the Viewpoint of Parameterized Complexity

This page was built for publication: Rank Reduction of Directed Graphs by Vertex and Edge Deletions