2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/139847We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orders.5 pages, 3 figuresCombinatoricsInformation Theorytext