Complexity of some Path Problems in DAGs and Linear Orders

Simple item page
dc.creatorBurckel, Serge
dc.date2007-10-11
dc.date.accessioned2026-07-07T08:35:45Z
dc.date.available2026-07-07T08:35:45Z
dc.descriptionWe 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.
dc.description5 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/0710.2268
dc.identifierhttp://arxiv.org/abs/0710.2268
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/139847
dc.subjectCombinatorics
dc.subjectInformation Theory
dc.titleComplexity of some Path Problems in DAGs and Linear Orders
dc.typetext

Files

Collections

arXiv