The complexity of finding certain trees in tournaments (Q5060108): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Realization of certain generalized paths in tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parity of paths and circuits in tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Antidirected Hamiltonian paths in tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of finding generalized paths in tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Antidirected Hamiltonian paths in tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Antidirected Hamiltonian circuits in tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3680863 / rank | |||
Normal rank |
Latest revision as of 07:46, 31 July 2024
scientific article; zbMATH DE number 7643380
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of finding certain trees in tournaments |
scientific article; zbMATH DE number 7643380 |
Statements
The complexity of finding certain trees in tournaments (English)
0 references
18 January 2023
0 references