A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time

DOI10.1016/j.laa.2018.03.019zbMath1391.05167arXiv1710.01639OpenAlexW2963385810MaRDI QIDQ1747105

Daniel A. Jaume, Gonzalo Molina, Adrián Pastine, Martín D. Safe

Publication date: 3 May 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.01639

zbMATH Keywords

forestnull space basissparsest basis

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

The non-negative spectrum of a digraph, On the core-nilpotent decomposition of trees

Cites Work

• Matrix sparsification and the sparse null space problem
• An algorithm to compute a sparse basis of the null space
• The second largest eigenvalue of a tree
• Null decomposition of trees
• \(\{-1,0,1\}\)-basis for the null space of a forest
• On simply structured bases of tree kernels
• TWO THEOREMS IN GRAPH THEORY
• The Null Space Problem I. Complexity
• Computing a Sparse Basis for the Null Space
• The Null Space Problem II. Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item