Complexity of some Path Problems in DAGs and Linear Orders
Serge Burckel
TL;DR
This paper examines the computational complexity of three natural path problems in directed acyclic graphs, proving their NP-completeness and exploring their restrictions to linear orders.
Contribution
It establishes NP-completeness for these problems and analyzes their complexity when restricted to linear orders, providing new insights.
Findings
Proved NP-completeness of three path problems in DAGs
Analyzed restrictions of these problems to linear orders
Provided complexity classifications for the problems
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Graph Theory Research · Advanced Algebra and Logic