An efficient algorithm for partial order production
From MaRDI portal
Publication:5172702
DOI10.1145/1536414.1536430zbMath1304.68068OpenAlexW2082319307MaRDI QIDQ5172702
Gwenaël Joret, J. Ian Munro, Samuel Fiorini, Raphaël M. Jungers, Jean Cardinal
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.248.1376
Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items
Near-optimal online multiselection in internal and external memory ⋮ Minimum Entropy Combinatorial Optimization Problems
