On classes of bounded tree rank, their interpretations, and efficient sparsification

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gajarský, Jakub, McCarty, Rose
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Data Structures and Algorithms Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2404.18904