"An improved upper bound for the online graph exploration problem on ..."

Koji M. Kobayashi, Ying Li (2024)

> Home

Details and statistics

DOI: 10.1007/S10878-024-01192-0

access: open

type: Journal Article

metadata version: 2024-12-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jco/KobayashiL24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/KobayashiL24
Koji M. Kobayashi, Ying Li:
An improved upper bound for the online graph exploration problem on unicyclic graphs. J. Comb. Optim. 48(1): 4 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.