- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Parameterized Counting of Partially Injective Homomorphisms ; day:11 ; month:3 ; year:2021 ; pages:1-32
Algorithmica ; (11.3.2021), 1-32
- Creator
-
Roth, Marc
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-021-00805-y
- URN
-
urn:nbn:de:101:1-2021040119360454328686
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:54 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
- Roth, Marc
- SpringerLink (Online service)
Other Objects (12)
On parameterized counting
Partially passed component counting for evaluating reliability
Counting Problems on Quantum Graphs : Parameterized and Exact Complexity Classifications
The simple, little and slow things count : on parameterized counting complexity
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
Parameterized complexity
Parameterized approximability
Parameterized randomization
Parameterized maximization
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Reoptimization of parameterized problems
On parameterized counting
Partially passed component counting for evaluating reliability
Counting Problems on Quantum Graphs : Parameterized and Exact Complexity Classifications
The simple, little and slow things count : on parameterized counting complexity
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
Parameterized complexity
Parameterized approximability
Parameterized randomization
Parameterized maximization
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Reoptimization of parameterized problems
On parameterized counting
Partially passed component counting for evaluating reliability
Counting Problems on Quantum Graphs : Parameterized and Exact Complexity Classifications
The simple, little and slow things count : on parameterized counting complexity
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
Parameterized complexity
Parameterized approximability
Parameterized randomization
Parameterized maximization
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter