The transposition median problem is NP-complete

Martin Bader. The transposition median problem is NP-complete. Theoretical Computer Science, 412(12-14):1099-1110, 2011. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.