- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2045-2322
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Exploring the brachistochrone (shortest-time) path in fire spread ; volume:12 ; number:1 ; day:10 ; month:8 ; year:2022 ; pages:1-11 ; date:12.2022
Scientific reports ; 12, Heft 1 (10.8.2022), 1-11, 12.2022
- Urheber
-
Sun, Peiyi
Liu, Yanhui
Huang, Xinyan
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1038/s41598-022-17321-w
- URN
-
urn:nbn:de:101:1-2022102603300914235243
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:26 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
- Sun, Peiyi
- Liu, Yanhui
- Huang, Xinyan
- SpringerLink (Online service)
Ähnliche Objekte (12)
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
Exploring Graph Partitioning for Shortest Path Queries on Road Networks
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Shortest path counting in probabilistic biological networks
Engineering planar-separator and shortest-path algorithms
Robot Navigation Beyond Planning the Shortest Path
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
Exploring Graph Partitioning for Shortest Path Queries on Road Networks
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Shortest path counting in probabilistic biological networks
Engineering planar-separator and shortest-path algorithms
Robot Navigation Beyond Planning the Shortest Path
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
Exploring Graph Partitioning for Shortest Path Queries on Road Networks
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Shortest path counting in probabilistic biological networks
Engineering planar-separator and shortest-path algorithms