Pages that link to "Item:Q1410686"
From MaRDI portal
The following pages link to On the monotonicity of games generated by symmetric submodular functions. (Q1410686):
Displaying 14 items.
- Contraction obstructions for connected graph searching (Q298950) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- Connected graph searching (Q690489) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Monotonicity in digraph search problems (Q955030) (← links)
- Submodular partition functions (Q1045090) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Monotonicity of strong searching on digraphs (Q2426650) (← links)
- Directed path-width and monotonicity in digraph searching (Q2502026) (← links)
- The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
- Tangle and Maximal Ideal (Q2980900) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- Searching by heterogeneous agents (Q5918998) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
