Cleaning a network with brushes
From MaRDI portal
Publication:930892
DOI10.1016/J.TCS.2008.02.037zbMATH Open1187.68185OpenAlexW1984969896MaRDI QIDQ930892FDOQ930892
Paweł Prałat, Margaret-Ellen Messinger, R. J. Nowakowski
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic aspects of Abelian sandpile models
- Chip-firing games on graphs
- Optimal Assignments of Numbers to Vertices
- Classes of lattices induced by chip firing (and sandpile) dynamics.
- Open problems of Paul Erd�s in graph theory
- Edge-isoperimetric inequalities in the grid
- The complexity of searching a graph
- Path decompositions and Gallai's conjecture
- Chip-Firing Games on Mutating Graphs
- LINEAR LAYOUT OF GENERALIZED HYPERCUBES
Cited In (22)
- Fast searching games on graphs
- Fast edge searching and fast searching on graphs
- The Robot Cleans Up
- Brushing number and zero-forcing number of graphs and their line graphs
- The robot cleans up
- Title not available (Why is that?)
- 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
- \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
- 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)
