Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"How quickly can you pack short paths? Engineering a search-tree algorithm ..."

Michael Kiran Huber (2024)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2404.10469

access: open

type: Informal or Other Publication

metadata version: 2024-05-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2404-10469
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2404-10469
Michael Kiran Huber:
How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length. CoRR abs/2404.10469 (2024)

a service of

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.