On locally presented posets

DOI10.1016/0304-3975(90)90125-2zbMath0701.06003OpenAlexW2051113106MaRDI QIDQ913830

Giorgio Gambosi, Maurizio Talamo, Jaroslav Nešetřil

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90125-2

zbMATH Keywords

labelingdimensionsboolean dimensionboolean formulaefficient encodingslocal presentationplanar directed acyclic graphs

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Boolean algebras (Boolean rings) (06E99)

Related Items

An efficient implicit data structure for relation testing and searching in partially ordered sets, Succinct posets, Boolean dimension and tree-width, The complexity of embedding orders into small products of chains, Boolean dimension and local dimension, Regular partitions of gentle graphs, Fractional local dimension, Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies, Finite paths are universal, Finite paths are universal, Comparing Dushnik-Miller dimension, Boolean dimension and local dimension, Boolean dimension, components and blocks, Finite presentation of homogeneous graphs, posets and Ramsey classes

Cites Work

• Chordality properties on graphs and minimal conceptual connections in semantic data models
• The dimension of planar posets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item