Hi, it seems there is an algorithm based on graph colouring (about what Sage knows a bit already), you can have a look at http://www.sciencedirect.com/science/article/pii/S0196677498909749 (i succeeded to download the pdf so email me if you need it)
Ciao, Thierry On Mon, Dec 22, 2014 at 01:19:52AM -0800, Nathann Cohen wrote: > Helloooooo everybody ! > > I wondered how one could compute the dimension of a poset, i.e. a smallest > set of linear extension whose interection is the poset. > > It is apparently known for being NP-Hard, but that never stopped us in the > past. Plus I am curious to learn how this could be done. We need some code > for that ! > > Tell me if you have any idea, please ! > > Thanks, > > Nathann > > -- > You received this message because you are subscribed to the Google Groups > "sage-devel" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to sage-devel+unsubscr...@googlegroups.com. > To post to this group, send email to sage-devel@googlegroups.com. > Visit this group at http://groups.google.com/group/sage-devel. > For more options, visit https://groups.google.com/d/optout. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
