Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs ; day:11 ; month:4 ; year:2021 ; pages:1-45
Algorithmica ; (11.4.2021), 1-45
- Urheber
-
Fomin, Fedor V.
Golovach, Petr A.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-021-00822-x
- URN
-
urn:nbn:de:101:1-2021053122210005276991
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:58 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Fomin, Fedor V.
- Golovach, Petr A.
- SpringerLink (Online service)
Ähnliche Objekte (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