Rank reduction of directed graphs by vertex and edge deletions

DOI10.1007/978-3-662-49529-2_46zbMATH Open1392.68329OpenAlexW2475663589MaRDI QIDQ2802973FDOQ2802973

Authors: Saket Saurabh, S. 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

Recommendations

• Rank reduction of oriented graphs by vertex and edge deletions
• Reducing rank of the adjacency matrix by graph modification
• Reducing rank of the adjacency matrix by graph modification
• scientific article
• Publication:4489140

Mathematics Subject Classification ID

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

Cited In (9)

• Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies
• Reducing rank of the adjacency matrix by graph modification
• Rank reduction of oriented graphs by vertex and edge deletions
• Parameterized low-rank binary matrix approximation
• Reducing rank of the adjacency matrix by graph modification
• Matrix Rigidity from the Viewpoint of Parameterized Complexity
• Parameterized low-rank binary matrix approximation
• Edge Weight Reduction Problems in Directed Acyclic Graphs
• Title not available (Why is that?)

This page was built for publication: Rank reduction of directed graphs by vertex and edge deletions

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