Monografie
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
- Sprache
-
Deutsch
- Identifier
-
1308009402
Thema
Graph; Berechnungskomplexität; Dekomposition; NP-hartes Problem; Effizienter Algorithmus
Beteiligte Personen und Organisationen
- DOI
-
10.18452/27478
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
07.12.2023, 15:21 MEZ
Objekttyp
- Monografie
Beteiligte
- Hegerfeld, Falko
- Kratsch, Stefan
- Siebertz, Sebastian
- Nederlof, Jesper
Ähnliche Objekte (12)
Efficient parameterized algorithms on structured graphs
Stable matchings beyond stable marriage: models, algorithms, complexity
Analyses and design of efficient graph partitioning methods
Competitive and voting location
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Preprocessing to Deal with Hard Problems
Effiziente Algorithmen für baumstrukturierte Graphklassen
Answering Conjunctive Queries and FO+MOD Queries under Updates
Assessing the computational complexity of multilayer subgraph detection
Analyses and design of efficient graph partitioning methods
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Efficient parameterized algorithms on structured graphs
Stable matchings beyond stable marriage: models, algorithms, complexity
Analyses and design of efficient graph partitioning methods
Competitive and voting location
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Preprocessing to Deal with Hard Problems
Effiziente Algorithmen für baumstrukturierte Graphklassen
Answering Conjunctive Queries and FO+MOD Queries under Updates
Assessing the computational complexity of multilayer subgraph detection
Analyses and design of efficient graph partitioning methods
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Efficient parameterized algorithms on structured graphs
Stable matchings beyond stable marriage: models, algorithms, complexity
Analyses and design of efficient graph partitioning methods
Competitive and voting location
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Preprocessing to Deal with Hard Problems
Effiziente Algorithmen für baumstrukturierte Graphklassen
Answering Conjunctive Queries and FO+MOD Queries under Updates
Assessing the computational complexity of multilayer subgraph detection
Analyses and design of efficient graph partitioning methods
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications