Brushing with additional cleaning restrictions

DOI10.1016/j.tcs.2014.09.005zbMath1339.05252OpenAlexW1991263747WikidataQ62043610 ScholiaQ62043610MaRDI QIDQ300254

Dariusz Dereniowski, Paweł Prałat, Piotr Borowiecki

Publication date: 27 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.005

zbMATH Keywords

chip firingbrush numbergraph searching

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Game brush number ⋮ Clearing directed subgraphs by mobile agents. Variations on covering with paths

Cites Work

• Unnamed Item
• Unnamed Item
• Cleaning with brooms
• Cleaning random \(d\)-regular graphs with brooms
• Chip-firing games on graphs
• Cleaning a network with brushes
• Parallel cleaning of a network with brushes
• Clean the graph before you draw it!
• Balanced vertex-orderings of graphs
• \textsc{polish} -- Let us play the cleaning game
• Imbalance is fixed parameter tractable
• Brushing without capacity restrictions
• Elimination schemes and lattices
• The chip-firing game
• Cleaning Regular Graphs with Brushes

This page was built for publication: Brushing with additional cleaning restrictions