Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP (Q4715273): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0963548300002054 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085072166 / rank | |||
Normal rank | |||
Latest revision as of 10:47, 30 July 2024
scientific article; zbMATH DE number 944204
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP |
scientific article; zbMATH DE number 944204 |
Statements
Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP (English)
0 references
29 June 1997
0 references
complete graph
0 references
edge colouring
0 references
cycle
0 references
alternating cycle
0 references
randomly polynomial
0 references
exact matching
0 references
