On building the transitive reduction of a two-dimensional poset

DOI10.1016/S0020-0190(97)00090-2zbMath1336.68273OpenAlexW2034117222MaRDI QIDQ287116

Enrico Nardelli, Vincenzo Mastrobuoni, Alesiano Santomo

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00090-2

zbMATH Keywords

algorithmsdata structurespartially ordered sets

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Combinatorics of partially ordered sets (06A07) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Scanline algorithms on a grid
• Transitive closure for restricted classes of partial orders
• A priority queue in which initialization and queue operations takeO(loglogD) time
• Fast algorithms for direct enclosures and direct dominances