Sciweavers

Share
CORR
2007
Springer

Complexity of some Path Problems in DAGs and Linear Orders

9 years 11 months ago
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 : .
Serge Burckel
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where CORR
Authors Serge Burckel
Comments (0)
books