Greedy universal cycle constructions for weak orders

DOI10.1007/978-3-030-39219-2_29zbMath1453.68229OpenAlexW3000997921MaRDI QIDQ779233

D. Kharzeev

Publication date: 21 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_29

zbMATH Keywords

greedy algorithmweak ordersuniversal cycleprefer-larger algorithmprefer-opposite algorithm

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Algorithms on strings (68W32)

Related Items (2)

Generating Gray codes for weak orders in constant amortized time ⋮ Efficient universal cycle constructions for weak orders

This page was built for publication: Greedy universal cycle constructions for weak orders