Positive Zero Forcing and Edge Clique Coverings
From MaRDI portal
Publication:4632169
DOI10.1007/978-3-319-39817-4_6zbMath1479.05201OpenAlexW2486389624MaRDI QIDQ4632169
Boting Yang, Abolghasem Soltani, Karen Meagher, Shaun M. Fallat
Publication date: 26 April 2019
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-39817-4_6
Cites Work
- Fast-mixed searching and related problems on graphs
- Lower bounds for positive semidefinite zero forcing and their applications
- Zero forcing parameters and minimum rank problems
- Claw-free graphs---a survey
- Positive semidefinite zero forcing
- Zero forcing sets and the minimum rank of graphs
- Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
- Positive semidefinite maximum nullity and zero forcing number
- Known Algorithms for Edge Clique Cover are Probably Optimal
- Nondiscriminatory propagation on trees
- Handbook of Graph Theory
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Data reduction and exact algorithms for clique cover
- On the complexity of the positive semidefinite zero forcing number
