Cleaning a network with brushes
From MaRDI portal
Publication:930892
DOI10.1016/j.tcs.2008.02.037zbMath1187.68185OpenAlexW1984969896MaRDI QIDQ930892
Paweł Prałat, Margaret-Ellen Messinger, Richard 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
Related Items (21)
Bounding the search number of graph products ⋮ Game brush number ⋮ Brushing with additional cleaning restrictions ⋮ The robot cleans up ⋮ On the brush number of the Cartesian product of tree with path or cycle ⋮ The robot crawler graph process ⋮ \textsc{polish} -- Let us play the cleaning game ⋮ Fast searching games on graphs ⋮ Fast edge searching and fast searching on graphs ⋮ Brushing without capacity restrictions ⋮ Elimination schemes and lattices ⋮ Cleaning with brooms ⋮ Cleaning random \(d\)-regular graphs with brooms ⋮ Brush your trees! ⋮ Clearing directed subgraphs by mobile agents. Variations on covering with paths ⋮ Brushing number and zero-forcing number of graphs and their line graphs ⋮ Parallel cleaning of a network with brushes ⋮ Unnamed Item ⋮ Clean the graph before you draw it! ⋮ Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm ⋮ The Robot Cleans Up
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chip-firing games on graphs
- Edge-isoperimetric inequalities in the grid
- Classes of lattices induced by chip firing (and sandpile) dynamics.
- Path decompositions and Gallai's conjecture
- The complexity of searching a graph
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Chip-Firing Games on Mutating Graphs
- Algebraic aspects of Abelian sandpile models
- Optimal Assignments of Numbers to Vertices
- LINEAR LAYOUT OF GENERALIZED HYPERCUBES
This page was built for publication: Cleaning a network with brushes
