Brushing without capacity restrictions (Q2449081): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cleaning Regular Graphs with Brushes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clean the graph before you draw it! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel cleaning of a network with brushes / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsc{polish} -- Let us play the cleaning game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imbalance Is Fixed Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cleaning a network with brushes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cleaning with brooms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination schemes and lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINEAR LAYOUT OF GENERALIZED HYPERCUBES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bisection width of grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cleaning random \(d\)-regular graphs with brooms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3614030 / rank
 
Normal rank

Latest revision as of 12:25, 8 July 2024

scientific article
Language Label Description Also known as
English
Brushing without capacity restrictions
scientific article

    Statements

    Brushing without capacity restrictions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 May 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    network cleaning
    0 references
    brush number
    0 references
    directed path covering
    0 references
    0 references