All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Counting Linear Extensions: Parameterizations by Treewidth

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00093946" target="_blank" >RIV/00216224:14330/16:00093946 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.4230/LIPIcs.ESA.2016.39" target="_blank" >http://dx.doi.org/10.4230/LIPIcs.ESA.2016.39</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4230/LIPIcs.ESA.2016.39" target="_blank" >10.4230/LIPIcs.ESA.2016.39</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Counting Linear Extensions: Parameterizations by Treewidth

  • Original language description

    We consider the #P-complete problem of counting the number of linear extensions of a poset (#LE); a fundamental problem in order theory with applications in a variety of distinct areas. In particular, we study the com- plexity of #LE parameterized by the well-known decompositional parameter treewidth for two natural graphical representations of the input poset, i.e., the cover and the incomparability graph. Our main result shows that #LE is xed- parameter intractable parameterized by the treewidth of the cover graph. This resolves an open problem recently posed in the Dagstuhl seminar on Exact Al- gorithms. On the positive side we show that #LE becomes xed-parameter tractable parameterized by the treewidth of the incomparability graph.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24, 2016, Aarhus, Denmark

  • ISBN

    9783959770156

  • ISSN

    1868-8969

  • e-ISSN

  • Number of pages

    18

  • Pages from-to

    1-18

  • Publisher name

    Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

  • Place of publication

    Aarhus, Denmark

  • Event location

    Denmark

  • Event date

    Jan 1, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article