Complexity of some Path Problems in DAGs and Linear Orders
Combinatorics
2007-10-12 v1 Information Theory
math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.0710.2268,
title = {Complexity of some Path Problems in DAGs and Linear Orders},
author = {Serge Burckel},
journal= {arXiv preprint arXiv:0710.2268},
year = {2007}
}
Comments
5 pages, 3 figures