Parallel cleaning of a network with brushes
From MaRDI portal
Recommendations
Cites work
- Chip-firing games on graphs
- Clean the graph before you draw it!
- Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
- Cleaning a network with brushes
- Cleaning random \(d\)-regular graphs with brooms
- Cleaning random graphs with brushes
- Cleaning regular graphs with brushes
- Cleaning with brooms
- Parallel chip firing games on graphs
- Searching and sweeping graphs: a brief survey
- The Robot Cleans Up
- The complexity of searching a graph
- The robot cleans up
Cited in
(13)- Clearing directed subgraphs by mobile agents. Variations on covering with paths
- Elimination schemes and lattices
- The Robot Cleans Up
- Brushing without capacity restrictions
- Cleaning a network with brushes
- Cleaning with brooms
- Cleaning random \(d\)-regular graphs with brooms
- Bounds on the cleaning times of robot vacuums
- Clean the graph before you draw it!
- A note on the parallel cleaning of cliques
- \textsc{polish} -- Let us play the cleaning game
- Game brush number
- Brushing with additional cleaning restrictions
This page was built for publication: Parallel cleaning of a network with brushes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968165)