Finding Two Disjoint Simple Paths on Two Sets of Points is NP-Complete.

Mohammadreza Razzazi Abdolah Sepahvand

Published in: CoRR (2017)

Keyphrases

np complete
randomly generated
computational complexity
np hard
point sets
databases
phase transition
pairwise
relational databases
data points
satisfiability problem
pspace complete