A poset dimension algorithm.



Downloads per month over past year

Yáñez, Javier and Montero, Javier (1999) A poset dimension algorithm. Journal of Algorithmst, 30 (1). pp. 185-208. ISSN 0196-6774

[thumbnail of Montero53.pdf] PDF
Restringido a Repository staff only


Official URL: http://www.sciencedirect.com/science/article/pii/S0196677498909749


This article presents an algorithm which computes the dimension of an arbitrary finite poset (partial order set). This algorithm is based on the chromatic number of a graph instead of the classical approach based on the chromatic number of some hypergraph. The relation between both approaches is analyzed. With this algorithm, the dimension of many modest size posets can be computed. Otherwise, an upper bound for the poset dimension is obtained. Some computational results are included. (C) 1999 Academic Press.

Item Type:Article
Uncontrolled Keywords:Hypergraph; Search problem
Subjects:Sciences > Computer science > Artificial intelligence
ID Code:16800
Deposited On:22 Oct 2012 08:36
Last Modified:10 Sep 2018 15:54

Origin of downloads

Repository Staff Only: item control page