Linear time algorithm to check the singularity of block graphs
From MaRDI portal
Publication:2326567
DOI10.1007/978-3-030-11509-8_7OpenAlexW2886869651MaRDI QIDQ2326567
Ranveer Singh, Naomi Shaked-Monderer, Abraham Berman
Publication date: 10 October 2019
Full work available at URL: https://arxiv.org/abs/1808.03411
Trees (05C05) Algorithms in computer science (68Wxx) Determinants, permanents, traces, other special matrix functions (15A15)
Related Items (2)
A linear time algorithm for the nullity of vertex-weighted block graphs ⋮ On \((k+1)\)-line graphs of \(k\)-trees and their nullities
This page was built for publication: Linear time algorithm to check the singularity of block graphs