Fast lattice browsing on sparse representations

DOI10.1007/BFB0019435MaRDI QIDQ4525269zbMATH OpenFDO

Authors Maurizio Talamo, Paola Vocca

Publication date 21 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0019435

Mathematics Subject Classification ID

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

Recommendations

• A data structure for lattice representation
• An Efficient Data Structure for Lattice Operations
• Bit-vector encoding for partially ordered sets
• An efficient implicit data structure for relation testing and searching in partially ordered sets
• Tree structure for distributive lattices and its applications

Cited in

(10)

• Lattice model of browsable data spaces
• A data structure for lattice representation
• A fast algorithm for building lattices
• An efficient implicit data structure for relation testing and searching in partially ordered sets
• Succinct posets
• An Efficient Data Structure for Lattice Operations
• Bit-vector encoding for partially ordered sets
• Time and space efficient representations of distributive lattices
• Faster neighbour list generation using a novel lattice vector representation
• Efficient polynomial algorithms for distributive lattices

This page was built for publication: Fast lattice browsing on sparse representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525269)