Solving systems of linear equations through zero forcing set
From MaRDI portal
Cites work
- A generalization of the fast LUP matrix decomposition algorithm and applications
- A Survey of the Game “Lights Out!”
- Chasing the lights in Lights Out
- Computational approaches for zero forcing and related problems
- Fast-mixed searching and related problems on graphs
- Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
- Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
- Generalized Nested Dissection
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- Improved Computational Approaches and Heuristics for Zero Forcing
- Lights Out on graphs
- Matrix sparsification and nested dissection over arbitrary fields
- Minimum rank problems
- Nondiscriminatory propagation on trees
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time
- On the minimum rank of not necessarily symmetric matrices: A preliminary study
- Zero forcing number, constrained matchings and strong structural controllability
- Zero forcing sets and the minimum rank of graphs
This page was built for publication: Solving systems of linear equations through zero forcing set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591655)
