Abstract: A method of compressing a graph representation, and method of solving a problem represented by a graph using graph compression enable improved data searching techniques. The graph representation includes a plurality of vertices and a plurality of edges. A first clustered graph is generated by clustering the plurality of vertices of the graph representation. Each cluster of vertices is then replaced by a clustered vertex, wherein the clustered vertex inherits edges from the vertices of the cluster. Superfluous edges of the first clustered graph are then removed. A traversal probability for each of the removed edges is determined, and one or more of the edges that have been removed is selected for embedding in the first clustered graph, based upon a traversal probability for each of the edges. Information relating to the one or more edges is then embedded into the first clustered graph.