How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Huber, Michael Kiran
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms 05C85, 68Q25 G.2.2; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2404.10469