The Computational Complexity of Positive Non-Clashing Teaching in Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ganian, Robert, Khazaliya, Liana, Inerney, Fionn Mc, Rocton, Mathis
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity Discrete Mathematics Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2503.07665