Seems like a bad sign either way. Even in conventional languages like C, recursion is a better fit for tree and graph algorithms, which is why they included recursion in the language. It might be ...

Recursive algorithms solve problems by repeatedly breaking ... more efficient and cost-effective solutions. Additionally, in graph theory-related problems—such as finding large independent ...

Very roughly speaking, his algorithm carries the graph isomorphism problem almost all the way across ... The Split-or-Johnson procedure contained a recursive step, in which a certain subroutine split ...