We consider the problem of link scheduling in multihop wireless networks subject to interference constraints. We consider a graph-based representation of wireless networks where scheduled links adhere to the K-hop link interference model. For this scheduling problem, we develop an asynchronous and distributed greedy heuristic. Furthermore, we show that this distributed heuristic computes the exact same schedule as the well-known centralized greedy link scheduling algorithm.