Solving systems of linear equations through zero forcing set
From MaRDI portal
Publication:6591655
DOI10.1007/978-3-031-49193-1_27MaRDI QIDQ6591655
Siyun Zhou, Chao Xu, Jianbo Wang
Publication date: 22 August 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast-mixed searching and related problems on graphs
- Zero forcing number, constrained matchings and strong structural controllability
- Minimum rank problems
- Computational approaches for zero forcing and related problems
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time
- Lights Out on graphs
- Zero forcing sets and the minimum rank of graphs
- A Survey of the Game “Lights Out!”
- On the minimum rank of not necessarily symmetric matrices: A preliminary study
- Nondiscriminatory propagation on trees
- Generalized Nested Dissection
- A generalization of the fast LUP matrix decomposition algorithm and applications
- Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
- Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
- Chasing the Lights in Lights Out
- Improved Computational Approaches and Heuristics for Zero Forcing
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)
