Greedy universal cycle constructions for weak orders

DOI10.1007/978-3-030-39219-2_29zbMATH Open1453.68229OpenAlexW3000997921MaRDI QIDQ779233FDOQ779233

Authors: D. Kharzeev 

Publication date: 21 July 2020

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

Recommendations

• Efficient universal cycle constructions for weak orders
• Universal cycles for weak orders
• On the Weakness of an Ordered Set
• Generating Gray codes for weak orders in constant amortized time
• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles

zbMATH Keywords

greedy algorithmweak ordersuniversal cycleprefer-larger algorithmprefer-opposite algorithm

Mathematics Subject Classification ID

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

Cited In (3)

• Generating Gray codes for weak orders in constant amortized time
• Efficient universal cycle constructions for weak orders
• Universal cycles for weak orders

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779233)