Positive semidefinite zero forcing: complexity and lower bounds

DOI10.1007/978-3-319-21840-3_52MaRDI QIDQ3449859zbMATH OpenOpenAlexFDO

Authors Boting Yang

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Lower bounds for positive semidefinite zero forcing and their applications
• On the complexity of the positive semidefinite zero forcing number
• The complexity of the positive semidefinite zero forcing
• Positive semidefinite zero forcing numbers of two classes of graphs
• Zero forcing parameters and minimum rank problems

Cites work

• Fast-mixed searching and related problems on graphs
• Graph minors. I. Excluding a forest
• Graph minors. III. Planar tree-width
• Minimum semidefinite rank of outerplanar graphs and the tree cover number
• Monotonicity in graph searching
• 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
• On the complexity of bicoloring clique hypergraphs of graphs
• On the complexity of the positive semidefinite zero forcing number
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Positive semidefinite zero forcing
• Strong-mixed searching and pathwidth
• The Recognition of Series Parallel Digraphs
• The complexity of searching a graph
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(11)

• An integer program for positive semidefinite zero forcing in graphs
• Positive semidefinite zero forcing numbers of two classes of graphs
• Failed skew zero forcing on a graph
• Throttling positive semidefinite zero forcing propagation time on graphs
• On the complexity of failed zero forcing
• Computational approaches for zero forcing and related problems
• On the complexity of the positive semidefinite zero forcing number
• The complexity of the positive semidefinite zero forcing
• Lower bounds for positive semidefinite zero forcing and their applications
• Power domination throttling
• Positive semidefinite zero forcing

This page was built for publication: Positive semidefinite zero forcing: complexity and lower bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449859)