Pages that link to "Item:Q999260"
From MaRDI portal
The following pages link to Monotony properties of connected visible graph searching (Q999260):
Displaying 10 items.
- On the monotonicity of process number (Q299059) (← links)
- Jumping robbers in digraphs (Q343927) (← links)
- Connected graph searching (Q690489) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Step-wise tile assembly with a constant number of tile types (Q1761741) (← links)
- A connected version of the graph coloring game (Q2192130) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- The cost of monotonicity in distributed graph searching (Q2377133) (← links)
- Combinatorial trace method for network immunization (Q2660957) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
