scientific article; zbMATH DE number 4047144

MaRDI QIDQ3783593zbMATH OpenFDO

Authors Giorgio Gambosi, J. Nešetřil, Maurizio Talamo

Publication date 1987

zbMATH Keywords

acyclic digraphBoolean dimension of posetsBoolean formuladata structurepath searchingquery time and space complexitytransitive closure of dags

Mathematics Subject Classification ID

Partial orders, general (06A06) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On locally presented posets
• Boolean dimension and local dimension
• Compact representation of posets
• scientific article; zbMATH DE number 4025488
• Succinct posets

Cited in

(9)

• An efficient implicit data structure for relation testing and searching in partially ordered sets
• Boolean dimension and tree-width
• Compact representation of posets
• Succinct posets
• scientific article; zbMATH DE number 4025488 (Why is no real title available?)
• scientific article; zbMATH DE number 5230562 (Why is no real title available?)
• Dynamic reachability in planar digraphs with one source and one sink
• Comparing Dushnik-Miller dimension, Boolean dimension and local dimension
• On locally presented posets

This page was built for publication:

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