6 research outputs found

    Parallel cleaning of a network with brushes

    Get PDF
    AbstractWe consider the process of cleaning a network where at each time step, all vertices that have at least as many brushes as incident, contaminated edges, send brushes down these edges and remove them from the network. An added condition is that, because of the contamination model used, the final configuration must be the initial configuration of another cleaning of the network. We find the minimum number of brushes required for trees, cycles, complete bipartite networks; and for all networks when all edges must be cleaned on each step. Finally, we give bounds on the number of brushes required for complete networks

    Game Brush Number

    Get PDF
    We study a two-person game based on the well-studied brushing process on graphs. Players Min and Max alternately place brushes on the vertices of a graph. When a vertex accumulates at least as many brushes as its degree, it sends one brush to each neighbor and is removed from the graph; this may in turn induce the removal of other vertices. The game ends once all vertices have been removed. Min seeks to minimize the number of brushes played during the game, while Max seeks to maximize it. When both players play optimally, the length of the game is the game brush number of the graph GG, denoted bg(G)b_g(G). By considering strategies for both players and modelling the evolution of the game with differential equations, we provide an asymptotic value for the game brush number of the complete graph; namely, we show that bg(Kn)=(1+o(1))n2/eb_g(K_n) = (1+o(1))n^2/e. Using a fractional version of the game, we couple the game brush numbers of complete graphs and the binomial random graph G(n,p)\mathcal{G}(n,p). It is shown that for pnlnnpn \gg \ln n asymptotically almost surely bg(G(n,p))=(1+o(1))pbg(Kn)=(1+o(1))pn2/eb_g(\mathcal{G}(n,p)) = (1 + o(1))p b_g(K_n) = (1 + o(1))pn^2/e. Finally, we study the relationship between the game brush number and the (original) brush number.Comment: 20 pages, 3 figure

    Clean the Graph Before You Draw It!

    No full text
    International audienceWe prove a relationship between the Cleaning problem and the Balanced Vertex-Ordering problem, namely that the minimum total imbalance of a graph equals twice the brush number of a graph. This equality has consequences for both problems. On one hand, it allows us to prove the View the NP-completeness of the Cleaning problem, which was conjectured by Messinger et al. [M.-E. Messinger, R.J. Nowakowski, P. Prałat, Cleaning a network with brushes, Theoret. Comput. Sci. 399 (2008) 191-205]. On the other hand, it also enables us to design a faster algorithm for the Balanced Vertex-Ordering problem [J. Kára, K. Kratochvíl, D. Wood, On the complexity of the balanced vertex ordering problem, Discrete Math. Theor. Comput. Sci. 9 (1) (2007) 193-202]
    corecore