Pages that link to "Item:Q393051"

The following pages link to Fast-mixed searching and related problems on graphs (Q393051):

Displaying 37 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)
• Computational approaches for zero forcing and related problems (Q1631510) (← links)
• Infection in hypergraphs (Q1701092) (← links)
• Throttling positive semidefinite zero forcing propagation time on graphs (Q1720308) (← links)
• Zero forcing in iterated line digraphs (Q1727740) (← links)
• The zero forcing polynomial of a graph (Q1732095) (← links)
• Brushing number and zero-forcing number of graphs and their line graphs (Q1756097) (← links)
• Bounds on expected propagation time of probabilistic zero forcing (Q1979443) (← links)
• Rigid linkages and partial zero forcing (Q2001975) (← links)
• Complexity and computation of connected zero forcing (Q2012050) (← links)
• On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← links)
• Product throttling (Q2073191) (← links)
• Properties of a \(q\)-analogue of zero forcing (Q2227980) (← links)
• Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
• Minimum rank and zero forcing number for butterfly networks (Q2424660) (← links)
• Connected power domination in graphs (Q2424811) (← links)
• Compressed cliques graphs, clique coverings and positive zero forcing (Q2636506) (← links)
• Throttling processes equivalent to full throttling on trees (Q2661773) (← links)
• The Complexity of the Positive Semidefinite Zero Forcing (Q2942442) (← links)
• Using Markov chains to determine expected propagation time for probabilistic zero forcing (Q3299342) (← links)
• Positive Semidefinite Zero Forcing: Complexity and Lower Bounds (Q3449859) (← links)
• Positive Zero Forcing and Edge Clique Coverings (Q4632169) (← links)
• A New Lower Bound for Positive Zero Forcing (Q4632220) (← links)
• k-Forcing number for Cartesian product of some graphs (Q4986275) (← links)
• Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
• Propagation time for probabilistic zero forcing (Q5090539) (← links)
• Skew throttling (Q5139699) (← links)
• Throttling for Zero Forcing and Variants (Q5206911) (← links)
• (Q5374237) (← links)
• On the complexity of the positive semidefinite zero forcing number (Q5962481) (← links)
• On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
• On graphs maximizing the zero forcing number (Q6157420) (← links)
• Solving systems of linear equations through zero forcing set (Q6591655) (← links)
• On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs (Q6633544) (← links)
• Minimal zero forcing sets (Q6644905) (← links)