Directed tree decompositions
Research output: Contribution to book/Conference proceedings/Anthology/Report › Conference contribution › Contributed › peer-review
Contributors
Abstract
In the problem session of the ICFCA 2006, Sándor Radeleczki asked for the meaning of the smallest integer k such that a given poset can be decomposed as the union of k directed trees. The problem also asks for the connection of this number to the order dimension. Since it was left open what kind of decomposition might be used, there is more than one reading of this problem. In the paper, we discuss different versions and give some answers to this open problem.
Details
| Original language | English |
|---|---|
| Title of host publication | Formal Concept Analysis - 12th International Conference, ICFCA 2014, Proceedings |
| Publisher | Springer-Verlag |
| Pages | 80-95 |
| Number of pages | 16 |
| ISBN (print) | 9783319072470 |
| Publication status | Published - 2014 |
| Peer-reviewed | Yes |
Publication series
| Series | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 8478 LNAI |
| ISSN | 0302-9743 |
Conference
| Title | 12th International Conference on Formal Concept Analysis, ICFCA 2014 |
|---|---|
| Duration | 10 - 13 June 2014 |
| City | Cluj-Napoca |
| Country | Romania |
Keywords
ASJC Scopus subject areas
Keywords
- directed tree, order dimension, poset decomposition