An Efficient Data Structure for Lattice Operations

DOI10.1137/S0097539794274404zbMath0927.06005OpenAlexW1966388760MaRDI QIDQ4268817

Paola Vocca, Maurizio Talamo

Publication date: 28 October 1999

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539794274404

zbMATH Keywords

reachabilitylatticesgraph decompositiondata structureleast common ancestors

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data encryption (aspects in computer science) (68P25) Data structures (68P05) Lattices (06B99)

Related Items (6)

Succinct posets ⋮ The complexity of embedding orders into small products of chains ⋮ Representing graphs implicitly using almost optimal space ⋮ Join-reachability problems in directed graphs ⋮ Partial order bounding: A new approach to evaluation in game tree search ⋮ Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies

This page was built for publication: An Efficient Data Structure for Lattice Operations