C*-equivalence of directed graphs

The graph C*-algebra construction associates a unital C*-algebra to any directed graph with finitely many vertices and countably many edges in a way which generalizes the fundamental construction by Cuntz and Krieger. We say that two such graphs are C*-equivalent when they define isomorphic C*-algebras, and give a description of this relation as the smallest equivalence relation generated by a number of "moves" on the graph that leave the C*-algebras unchanged. The talk is based on recent work with Arklint and Ruiz, but most of these moves have a long history that I intend to present in some detail.