This paper describes the problem of information retrieval in graph structures (particularly, subgraph isomorphism problem) and compares popular algorithms (Ullman`s algorithm for subgraph isomorphism, VF2 algorithm). There are given some features and limitations of mentioned algorithms.