A fast randomized algorithm for partitioning a graph into paths of fixed length (Q1803681)
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: A fast randomized algorithm for partitioning a graph into paths of fixed length |
scientific article; zbMATH DE number 221659
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast randomized algorithm for partitioning a graph into paths of fixed length |
scientific article; zbMATH DE number 221659 |
Statements
A fast randomized algorithm for partitioning a graph into paths of fixed length (English)
0 references
29 June 1993
0 references
randomized extension-rotation algorithm
0 references
partition
0 references
random graphs
0 references
0.9110479
0 references
0.9068372
0 references
0.9064948
0 references
0.9042877
0 references
0 references
0.9002255
0 references
0.89845276
0 references
