A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
label / enlabel / en
 
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.IPEC.2018.5 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: FLINT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: WEKA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transitive Reduction of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the number of linear extensions of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using TPA to count linear extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree decompositions with small cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting linear extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bucket elimination: A unifying framework for reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random polynomial-time algorithm for approximating the volume of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Linear Extensions: Parameterizations by Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Library for Number Theory: An Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming meets the principle of inclusion and exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical hardness models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5283021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Rank Tests and Semigraphoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Partial-Order Plan Relaxation via MaxSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2810856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results in minimum-comparison sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bit-complexity of sparse polynomial and series multiplication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2019/10206/pdf/LIPIcs-IPEC-2018-5.pdf / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2920579836 / rank
 
Normal rank
Property / title
 
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (English)
Property / title: A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.IPEC.2018.5 / rank
 
Normal rank

Latest revision as of 15:36, 30 December 2024

scientific article; zbMATH DE number 7378591
Language Label Description Also known as
English
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
scientific article; zbMATH DE number 7378591

    Statements

    0 references
    0 references
    0 references
    4 August 2021
    0 references
    algorithm selection
    0 references
    empirical hardness
    0 references
    linear extension
    0 references
    multiplication of polynomials
    0 references
    tree decomposition
    0 references
    0 references
    0 references
    A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (English)
    0 references

    Identifiers