Pages that link to "Item:Q674341"
From MaRDI portal
The following pages link to Mixed searching and proper-path-width (Q674341):
Displayed 17 items.
- Edge search number of cographs (Q415273) (← links)
- Mixed searching and proper-path-width (Q674341) (← links)
- Strong-mixed searching and pathwidth (Q867027) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Minimum dominating set of queens: a trivial programming exercise? (Q968146) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- Graph Searching in a Crime Wave (Q3508551) (← links)
- Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
- Searching for a Visible, Lazy Fugitive (Q5302068) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)