Parallel cleaning of a network with brushes

DOI10.1016/j.dam.2009.11.003zbMath1185.90024OpenAlexW1999881791MaRDI QIDQ968165

Paweł Prałat, Margaret-Ellen Messinger, Serge Gaspers, Richard J. Nowakowski

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.11.003

zbMATH Keywords

chip firing gamebrush numberedge searching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (10)

Game brush number ⋮ Brushing with additional cleaning restrictions ⋮ \textsc{polish} -- Let us play the cleaning game ⋮ Brushing without capacity restrictions ⋮ Elimination schemes and lattices ⋮ Cleaning with brooms ⋮ Cleaning random \(d\)-regular graphs with brooms ⋮ Clearing directed subgraphs by mobile agents. Variations on covering with paths ⋮ Clean the graph before you draw it! ⋮ Searching by heterogeneous agents

Cites Work

• Unnamed Item
• Unnamed Item
• Cleaning with brooms
• Cleaning random \(d\)-regular graphs with brooms
• Chip-firing games on graphs
• The robot cleans up
• Cleaning a network with brushes
• Clean the graph before you draw it!
• Parallel chip firing games on graphs
• The complexity of searching a graph
• Cleaning Regular Graphs with Brushes
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
• The Robot Cleans Up

This page was built for publication: Parallel cleaning of a network with brushes