Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Deák, Bence, Madarasi, Péter
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2604.13025