Cleaning a network with brushes
type: Item
instance of: scholarly article
title: Cleaning a network with brushes
zbMATH Open document ID: 1187.68185
published in: Theoretical Computer Science
publication date: 2008-06-24T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5292232
zbMATH Keywords: searching
zbMATH Keywords: chip firing
zbMATH Keywords: cleaning sequence
zbMATH Keywords: brush number
author: Margaret-Ellen Messinger
author: R. J. Nowakowski
author: Paweł Prałat
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.02.037
OpenAlex ID: W1984969896
cites work: Q3418339
cites work: Chip-firing games on graphs
cites work: Edge-isoperimetric inequalities in the grid
cites work: Open problems of Paul Erd�s in graph theory
cites work: Algebraic aspects of Abelian sandpile models
cites work: Chip-Firing Games on Mutating Graphs
cites work: Path decompositions and Gallai's conjecture
cites work: Optimal Assignments of Numbers to Vertices
cites work: Classes of lattices induced by chip firing (and sandpile) dynamics.
cites work: The complexity of searching a graph
cites work: Q4331212
cites work: LINEAR LAYOUT OF GENERALIZED HYPERCUBES
cites work: Q4159394
cites work: Q3208679
DOI: 10.1016/J.TCS.2008.02.037
description: scientific article; zbMATH DE number 5292232