- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Parameterized Complexity of Graph Burning ; day:11 ; month:4 ; year:2022 ; pages:1-15
Algorithmica ; (11.4.2022), 1-15
- Urheber
-
Kobayashi, Yasuaki
Otachi, Yota
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-022-00962-8
- URN
-
urn:nbn:de:101:1-2022062619265294509667
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:32 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
- Kobayashi, Yasuaki
- Otachi, Yota
- SpringerLink (Online service)
Ähnliche Objekte (12)
Parameterized complexity
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Parameterized complexity theory
Classic graph problems made temporal - a parameterized complexity analysis
Classic graph problems made temporal – a parameterized complexity analysis
Algorithmic graph minor theory : approximation, parameterized complexity, and practical aspects
Counting Problems on Quantum Graphs : Parameterized and Exact Complexity Classifications
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized Complexity of Directed Spanner Problems
Parameterized complexity
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Parameterized complexity theory
Classic graph problems made temporal - a parameterized complexity analysis
Classic graph problems made temporal – a parameterized complexity analysis
Algorithmic graph minor theory : approximation, parameterized complexity, and practical aspects
Counting Problems on Quantum Graphs : Parameterized and Exact Complexity Classifications
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized Complexity of Directed Spanner Problems
Parameterized complexity
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Parameterized complexity theory
Classic graph problems made temporal - a parameterized complexity analysis
Classic graph problems made temporal – a parameterized complexity analysis
Algorithmic graph minor theory : approximation, parameterized complexity, and practical aspects
Counting Problems on Quantum Graphs : Parameterized and Exact Complexity Classifications
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs