Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs ; day:11 ; month:4 ; year:2021 ; pages:1-45
Algorithmica ; (11.4.2021), 1-45
- Creator
-
Fomin, Fedor V.
Golovach, Petr A.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-021-00822-x
- URN
-
urn:nbn:de:101:1-2021053122210005276991
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:58 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
- Fomin, Fedor V.
- Golovach, Petr A.
- SpringerLink (Online service)
Other Objects (12)
Efficient parameterized algorithms on structured graphs
Parallel parameterized algorithms
Algorithms and experiments for parameterized approaches to hard graph problems
Parameterized approximation algorithms for orienteering
Parameterized Mixed Graph Coloring
Parameterized Complexity of Graph Burning
Graph separators - a parameterized view
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Parameterized algorithms for stochastic Steiner tree problems
A Parameterized View on Transportation Networks : Algorithms, Hierarchy, and Complexity
Efficient parameterized algorithms on structured graphs
Parallel parameterized algorithms
Algorithms and experiments for parameterized approaches to hard graph problems
Parameterized approximation algorithms for orienteering
Parameterized Mixed Graph Coloring
Parameterized Complexity of Graph Burning
Graph separators - a parameterized view
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Parameterized algorithms for stochastic Steiner tree problems
A Parameterized View on Transportation Networks : Algorithms, Hierarchy, and Complexity
Efficient parameterized algorithms on structured graphs
Parallel parameterized algorithms
Algorithms and experiments for parameterized approaches to hard graph problems
Parameterized approximation algorithms for orienteering
Parameterized Mixed Graph Coloring
Parameterized Complexity of Graph Burning
Graph separators - a parameterized view
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Parameterized algorithms for stochastic Steiner tree problems