Pages that link to "Item:Q1045071"
From MaRDI portal
The following pages link to Sweeping graphs with large clique number (Q1045071):
Displayed 16 items.
- On the monotonicity of process number (Q299059) (← links)
- On minimum cost edge searching (Q391138) (← links)
- Exclusive graph searching (Q521823) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- Connected graph searching (Q690489) (← links)
- Connected searching of weighted trees (Q719311) (← links)
- Network decontamination under \(m\)-immunity (Q908298) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Searching for an intruder on graphs and their subdivisions (Q2153405) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
- Three-fast-searchable graphs (Q2446838) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- Searching by heterogeneous agents (Q5918998) (← links)
- On-line search in two-dimensional environment (Q5919296) (← links)
- Connected search for a lazy robber (Q6080862) (← links)