Deciding if a shadow resolves into a given link: linear-time algorithms

Andrea Alba, Gelasio Salazar

A {\em shadow} (or {\em projection}) is obtained from a link diagram by ignoring the over/under information at each crossing. Given a fixed link $L$ we investigate the complexity o…