- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions ; day:3 ; month:10 ; year:2019 ; pages:1-18
Algorithmica ; (3.10.2019), 1-18
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-019-00633-1
- URN
-
urn:nbn:de:101:1-2020021208421901758743
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:02 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kangas, Kustaa
- Koivisto, Mikko O.
- Salonen, Sami
- SpringerLink (Online service)
Other Objects (12)
Counting Cherry Reduction Sequences in Phylogenetic Tree-Child Networks is Counting Linear Extensions
Counting Boolean functions with faster points
Counting Linear Extensions: Parameterizations by Treewidth
Faster algorithms for counting subgraphs in sparse graphs
Semiring extensions for model counting and model sampling
Counting, grafting and evolving binary trees
Gaifman normal forms for counting extensions of first-order logic
Counting solutions of algebraic systems via triangular decomposition
Counting solutions of algebraic systems via triangular decomposition
Faster CNN-based vehicle detection and counting strategy for fixed camera scenes
Butterfly counting and bitruss decomposition on uncertain bipartite graphs
Photon-counting computed tomography thermometry via material decomposition and machine learning
Counting Cherry Reduction Sequences in Phylogenetic Tree-Child Networks is Counting Linear Extensions
Counting Boolean functions with faster points
Counting Linear Extensions: Parameterizations by Treewidth
Faster algorithms for counting subgraphs in sparse graphs
Semiring extensions for model counting and model sampling
Counting, grafting and evolving binary trees
Gaifman normal forms for counting extensions of first-order logic
Counting solutions of algebraic systems via triangular decomposition
Counting solutions of algebraic systems via triangular decomposition
Faster CNN-based vehicle detection and counting strategy for fixed camera scenes
Butterfly counting and bitruss decomposition on uncertain bipartite graphs
Photon-counting computed tomography thermometry via material decomposition and machine learning
Counting Cherry Reduction Sequences in Phylogenetic Tree-Child Networks is Counting Linear Extensions
Counting Boolean functions with faster points
Counting Linear Extensions: Parameterizations by Treewidth
Faster algorithms for counting subgraphs in sparse graphs
Semiring extensions for model counting and model sampling
Counting, grafting and evolving binary trees
Gaifman normal forms for counting extensions of first-order logic
Counting solutions of algebraic systems via triangular decomposition
Counting solutions of algebraic systems via triangular decomposition
Faster CNN-based vehicle detection and counting strategy for fixed camera scenes
Butterfly counting and bitruss decomposition on uncertain bipartite graphs