An improved upper bound for the online graph exploration problem on unicyclic graphs
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
An improved upper bound for the online graph exploration problem on unicyclic graphs ; volume:48 ; number:1 ; day:29 ; month:7 ; year:2024 ; pages:1-38 ; date:8.2024
Journal of combinatorial optimization ; 48, Heft 1 (29.7.2024), 1-38, 8.2024
- Creator
-
Kobayashi, Koji M.
Li, Ying
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10878-024-01192-0
- URN
-
urn:nbn:de:101:1-2411120908556.725008181150
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:33 AM CEST
Data provider
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kobayashi, Koji M.
- Li, Ying
- SpringerLink (Online service)