Bakhshandeh et al have addressed the search problem of identifying the degree of separation between two users in social networks such as Twitter. They have introduced new search techniques to provide optimal or near optimal solutions. The experiments are performed using Twitter, and they show an improvement of several orders of magnitude over greedy approaches. Their optimal algorithm finds an average degree of separation of 3.43 between two random Twitter users, requiring an average of only 67 requests for information over the Internet to Twitter. A near-optimal solution of length 3.88 can be found by making an average of 13.3 requests.