Positive Semidefinite Zero Forcing: Complexity and Lower Bounds
From MaRDI portal
Publication:3449859
DOI10.1007/978-3-319-21840-3_52zbMath1451.68210OpenAlexW2405789908MaRDI QIDQ3449859
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_52
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Failed skew zero forcing on a graph ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ On the complexity of failed zero forcing ⋮ Power domination throttling
Cites Work
- Fast-mixed searching and related problems on graphs
- Graph minors. III. Planar tree-width
- Strong-mixed searching and pathwidth
- Zero forcing parameters and minimum rank problems
- Graph minors. I. Excluding a forest
- Positive semidefinite zero forcing
- Zero forcing sets and the minimum rank of graphs
- Minimum semidefinite rank of outerplanar graphs and the tree cover number
- Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
- On the Fast Searching Problem
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- The complexity of searching a graph
- The Recognition of Series Parallel Digraphs
- Monotonicity in graph searching
- On the complexity of bicoloring clique hypergraphs of graphs
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- On the complexity of the positive semidefinite zero forcing number
This page was built for publication: Positive Semidefinite Zero Forcing: Complexity and Lower Bounds
