Fast probabilistic algorithms for Hamiltonian circuits and matchings (Q1141153): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q105583530, #quickstatements; #temporary_batch_1706301185450 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:53, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast probabilistic algorithms for Hamiltonian circuits and matchings |
scientific article |
Statements
Fast probabilistic algorithms for Hamiltonian circuits and matchings (English)
0 references
1979
0 references
probabilistic behaviour
0 references
Hamiltonian circuit
0 references
random graph
0 references
perfect matching
0 references
