Positive Semidefinite Zero Forcing: Complexity and Lower Bounds (Q3449859): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-21840-3_52
+Normal rank
@@ Property / OpenAlex ID @@
+W2405789908
@@ Property / OpenAlex ID: W2405789908 / rank @@
+Normal rank
@@ Property / cites work @@
+Zero forcing sets and the minimum rank of graphs
@@ Property / cites work: Zero forcing sets and the minimum rank of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
+Normal rank
@@ Property / cites work @@
+Zero forcing parameters and minimum rank problems
@@ Property / cites work: Zero forcing parameters and minimum rank problems / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum semidefinite rank of outerplanar graphs and the tree cover number
+Normal rank
@@ Property / cites work @@
+Monotonicity in graph searching
@@ Property / cites work: Monotonicity in graph searching / rank @@
+Normal rank
@@ Property / cites work @@
+On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
+Normal rank
@@ Property / cites work @@
+On the Fast Searching Problem
@@ Property / cites work: On the Fast Searching Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Positive semidefinite zero forcing
@@ Property / cites work: Positive semidefinite zero forcing / rank @@
+Normal rank
@@ Property / cites work @@
+Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
+Normal rank
@@ Property / cites work @@
+On the complexity of the positive semidefinite zero forcing number
+Normal rank
@@ Property / cites work @@
+On the complexity of bicoloring clique hypergraphs of graphs
+Normal rank
@@ Property / cites work @@
+The complexity of searching a graph
@@ Property / cites work: The complexity of searching a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+The Recognition of Series Parallel Digraphs
@@ Property / cites work: The Recognition of Series Parallel Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fast-mixed searching and related problems on graphs
+Normal rank
@@ Property / cites work @@
+Strong-mixed searching and pathwidth
@@ Property / cites work: Strong-mixed searching and pathwidth / rank @@
+Normal rank