Pages that link to "Item:Q867027"
From MaRDI portal
The following pages link to Strong-mixed searching and pathwidth (Q867027):
Displaying 8 items.
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- On the weak prefix-search problem (Q390882) (← links)
- Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
- Mixed searching and proper-path-width (Q674341) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
- Positive Semidefinite Zero Forcing: Complexity and Lower Bounds (Q3449859) (← links)