Succinct Posets

• Published in: Algorithmica Vol. 76; no. 2; pp. 445 - 473
• Main Authors: Munro, J. Ian, Nicholson, Patrick K.
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.10.2016; Springer Nature B.V
• Subjects: Algorithm Analysis and Problem Complexity; Algorithms; Computer Science; Computer Systems Organization and Communication Networks; Data Structures and Information Theory; Graph theory; Graphical representations; Mathematics of Computing; Set theory; Theory of Computation; Partial orders; Graph compression; Succinct data structure; Rank and select; Data compression; Balanced bipartite graphs; Graph representations; Zarankiewicz problem

We design a succinct data structure for representing a poset that, given two elements, can report whether one precedes the other in constant time. This is equivalent to succinctly representing the transitive closure graph of the poset, and we note that the same method can also be used to succinctly...