Path Contraction Faster than $2^n$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Agrawal, Akanksha, Fomin, Fedor V., Lokshtanov, Daniel, Saurabh, Saket, Tale, Prafullkumar
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2505.13996