Complexity of some Path Problems in DAGs and Linear Orders

We 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. Mathematics Subjects Classification : .

• Type: Journal
• Year: 2007
• Where: CORR
• Authors: Serge Burckel
• Keywords: Acyclic Graphs, Computational Complexity, CORR 2007, Education, NP Completeness