A Poset Dimension Algorithm

DOI10.1006/jagm.1998.0974zbMath0914.68149OpenAlexW2020737333MaRDI QIDQ4228291

Javier Montero, Javier Yáñez

Publication date: 21 June 1999

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1998.0974

zbMATH Keywords

hypergraphsearch problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography ⋮ Soft dimension theory. ⋮ Searching for the dimension of valued preference relations. ⋮ Fuzzy classification systems. ⋮ Partial order bounding: A new approach to evaluation in game tree search ⋮ AN ALGORITHMIC APPROACH TO PREFERENCE REPRESENTATION ⋮ A study of the order dimension of a poset using matrices ⋮ Crisp dimension theory and valued preference relations ⋮ A study of the quasi covering dimension of finite lattices ⋮ Block circulant graphs and the graphs of critical pairs of crowns

This page was built for publication: A Poset Dimension Algorithm