Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs. (Q52066136)
Jump to navigation
Jump to search
scientific article published in February 2001
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs. |
scientific article published in February 2001 |
Statements
1 reference
Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs. (English)
1 reference
1 reference
Hartmann AK
1 reference
1 February 2001
1 reference
86
1 reference
8
1 reference
1658-1661
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
Identifiers
1 reference