The following pages link to Cleaning a network with brushes (Q930892):
Displaying 22 items.
- Game brush number (Q290091) (← links)
- Network decontamination with a single agent (Q292259) (← links)
- Brushing with additional cleaning restrictions (Q300254) (← links)
- Fast searching games on graphs (Q411259) (← links)
- Brush your trees! (Q494441) (← links)
- Fast edge searching and fast searching on graphs (Q631784) (← links)
- Cleaning with brooms (Q659685) (← links)
- Cleaning random \(d\)-regular graphs with brooms (Q659724) (← links)
- The robot cleans up (Q849139) (← links)
- Parallel cleaning of a network with brushes (Q968165) (← links)
- Clean the graph before you draw it! (Q987793) (← links)
- The robot crawler graph process (Q1671307) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Brushing number and zero-forcing number of graphs and their line graphs (Q1756097) (← links)
- \textsc{polish} -- Let us play the cleaning game (Q1929225) (← links)
- On the brush number of the Cartesian product of tree with path or cycle (Q2399728) (← links)
- Brushing without capacity restrictions (Q2449081) (← links)
- Elimination schemes and lattices (Q2449178) (← links)
- (Q5088675) (← links)
- Bounding the search number of graph products (Q5215862) (← links)
- Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm (Q5458503) (← links)
- The Robot Cleans Up (Q5505669) (← links)
