Cleaning random \(d\)-regular graphs with brooms (Q659724)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cleaning random d-regular graphs with brooms |
scientific article; zbMATH DE number 5999855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cleaning random \(d\)-regular graphs with brooms |
scientific article; zbMATH DE number 5999855 |
Statements
Cleaning random \(d\)-regular graphs with brooms (English)
0 references
24 January 2012
0 references
cleaning with brushes
0 references
cleaning with Broom number
0 references
random \(d\)-regular graphs
0 references
differential equations method
0 references
graph searching
0 references
0 references
0 references
0 references
0.9340642094612122
0 references
0.9329620599746704
0 references
0.9107838869094848
0 references
0.8740323185920715
0 references
0.8174123764038086
0 references
