Cleaning a network with brushes

DOI10.1016/J.TCS.2008.02.037MaRDI QIDQ930892zbMATH OpenOpenAlexFDO

Authors Margaret-Ellen Messinger, R. J. Nowakowski, Paweł Prałat

Publication date 24 June 2008

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

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

zbMATH Keywords

chip firingbrush numbersearchingcleaning sequence

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Recommendations

• Parallel cleaning of a network with brushes
• Brushing with additional cleaning restrictions
• Cleaning random graphs with brushes
• Brushing without capacity restrictions
• Cleaning regular graphs with brushes

Cites work

• scientific article; zbMATH DE number 3650583 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• scientific article; zbMATH DE number 1741027 (Why is no real title available?)
• Algebraic aspects of Abelian sandpile models
• Chip-Firing Games on Mutating Graphs
• Chip-firing games on graphs
• Classes of lattices induced by chip firing (and sandpile) dynamics.
• Edge-isoperimetric inequalities in the grid
• LINEAR LAYOUT OF GENERALIZED HYPERCUBES
• Open problems of Paul Erd�s in graph theory
• Optimal Assignments of Numbers to Vertices
• Path decompositions and Gallai's conjecture
• Searching and sweeping graphs: a brief survey
• The complexity of searching a graph

Cited in

(25)

• Fast searching games on graphs
• Fast edge searching and fast searching on graphs
• Brushing number and zero-forcing number of graphs and their line graphs
• The Robot Cleans Up
• The robot cleans up
• scientific article; zbMATH DE number 7556143 (Why is no real title available?)
• Game brush number
• Brushing with additional cleaning restrictions
• Network decontamination with a single agent
• Cleaning with brooms
• Cleaning random \(d\)-regular graphs with brooms
• Bounding the search number of graph products
• Parallel cleaning of a network with brushes
• Clean the graph before you draw it!
• The robot crawler graph process
• Cleaning random graphs with brushes
• Cleaning regular graphs with brushes
• \textsc{polish} -- Let us play the cleaning game
• Clearing directed subgraphs by mobile agents. Variations on covering with paths
• On the brush number of the Cartesian product of tree with path or cycle
• A note on the parallel cleaning of cliques
• Brush your trees!
• Brushing without capacity restrictions
• Elimination schemes and lattices
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm

This page was built for publication: Cleaning a network with brushes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930892)