Computing a poset from its realizer

DOI10.1016/S0020-0190(97)00166-XzbMATH Open1336.68274OpenAlexW2103768465MaRDI QIDQ287260FDOQ287260

Authors: 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)00166-x

Recommendations

• Realization of Posets
• Realizable posets
• Towards the reconstruction of posets
• Computability of a topological poset
• Filters on computable posets
• scientific article; zbMATH DE number 3974996
• Realisability of pomsets
• A Poset Dimension Algorithm
• scientific article; zbMATH DE number 1172554
• scientific article; zbMATH DE number 3995740

zbMATH Keywords

data structurespartially ordered sets

Mathematics Subject Classification ID

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

Cites Work

• Log-logarithmic worst-case range queries are possible in space theta(N)
• Computing a poset from its realizer
• Title not available (Why is that?)
• Title not available (Why is that?)
• Adding range restriction capability to dynamic data structures
• Efficient data structures for range searching on a grid
• An improved algorithm for the rectangle enclosure problem
• Title not available (Why is that?)

Cited In (1)

• Computing a poset from its realizer

This page was built for publication: Computing a poset from its realizer

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