Caricamento...
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...
Salvato in:
| Pubblicato in: | Algorithmica |
|---|---|
| Autori principali: | , , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Springer US
2018
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6449496/ https://ncbi.nlm.nih.gov/pubmed/31007326 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s00453-018-0496-4 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|