Counting Linear Extensions: Parameterizations by Treewidth

We consider the [Formula: see text] -complete problem of counting the number of linear extensions of a poset [Formula: see text] ; a fundamental problem in order theory with applications in a variety of distinct areas. In particular, we study the complexity of [Formula: see text] parameterized by th...

Descripción completa

Detalles Bibliográficos
Autores principales: Eiben, E., Ganian, R., Kangas, K., Ordyniak, S.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2018
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6449496/
https://www.ncbi.nlm.nih.gov/pubmed/31007326
http://dx.doi.org/10.1007/s00453-018-0496-4

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6449496/
https://www.ncbi.nlm.nih.gov/pubmed/31007326
http://dx.doi.org/10.1007/s00453-018-0496-4

Ejemplares similares