Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Greedy universal cycle constructions for weak orders

From MaRDI portal
Publication:779233
Jump to:navigation, search

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


Authors: D. Kharzeev Edit this on Wikidata


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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:779233&oldid=12708025"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 11:04. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki