scientific article
From MaRDI portal
Publication:3783593
zbMath0642.68116MaRDI QIDQ3783593
Maurizio Talamo, Jaroslav Nešetřil, Giorgio Gambosi
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
acyclic digraphdata structureBoolean formulapath searchingBoolean dimension of posetsquery time and space complexitytransitive closure of dags
Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Searching and sorting (68P10)
Related Items (6)
An efficient implicit data structure for relation testing and searching in partially ordered sets ⋮ Succinct posets ⋮ Boolean dimension and tree-width ⋮ On locally presented posets ⋮ Dynamic reachability in planar digraphs with one source and one sink ⋮ Comparing Dushnik-Miller dimension, Boolean dimension and local dimension
This page was built for publication:
