Researchers Prove NP-Completeness of Outerplanar and Forest Storyplans

The decision problem for outerplanar or forest storyplans is NP‑complete, yet FPT algorithms handle graphs with treewidth ≤3. Read more: getnews.me/researchers-prove-np-com... #storyplan #npcomplete