Complexity of some Path Problems in DAGs and Linear Orders - Mathematics > CombinatoricsReport as inadecuate




Complexity of some Path Problems in DAGs and Linear Orders - Mathematics > Combinatorics - Download this document for free, or read online. Document in PDF available to download.

Abstract: We investigate here the computational complexity of three natural problems indirected acyclic graphs. We prove their NP Completeness and consider theirrestrictions to linear orders.



Author: Serge Burckel

Source: https://arxiv.org/







Related documents