A bipartite cache is represented as a bipartite graph (aka bigraph), a graph with two disjoint sets of vertices (disjoint set is a set whose no member is shared with other sets) such that every edge connects a vertex in the first set to another vertex in the other set and there are no two vertices in the same set are connected to each other.
