Pages that link to "Item:Q393051"
From MaRDI portal
The following pages link to Fast-mixed searching and related problems on graphs (Q393051):
Displayed 11 items.
- Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
- The fast search number of a Cartesian product of graphs (Q526821) (← links)
- On the complexity of failed zero forcing (Q729899) (← links)
- Infection in hypergraphs (Q1701092) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← links)
- Compressed cliques graphs, clique coverings and positive zero forcing (Q2636506) (← links)
- The Complexity of the Positive Semidefinite Zero Forcing (Q2942442) (← links)
- Positive Semidefinite Zero Forcing: Complexity and Lower Bounds (Q3449859) (← links)
- (Q5374237) (← links)
- On the complexity of the positive semidefinite zero forcing number (Q5962481) (← links)