加载中…
2007-10-11
Complexity of some Path Problems in DAGs and Linear Orders
Serge Burckel
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本