A related concept is a biclique, a complete bipartite subgraph. The blossom algorithm finds a maximum-cardinality matching in general (not bipartite) graphs. Similarly, outerplanar graphs are (2,3)-sparse and planar bipartite graphs are (2,4)-sparse. Biadjacency matrices may be used to describe equivalences between bipartite graphs, hypergraphs, and directed graphs. Isomorphic bipartite graphs have the same degree sequence. Apply a bipartite graph edge coloring algorithm to . One version was based on bipartite spectral graph partitioning. An LDPC is constructed using a sparse Tanner graph (subclass of the bipartite graph). This bipartite graph is also called incidence graph. An exact cover problem can be represented by an incidence matrix or a bipartite graph. Finding a matching in a bipartite graph can be treated as a network flow problem. The maximum size bicluster is equivalent to maximum edge biclique in bipartite graph. All other points remain #P-hard, even for bipartite planar graphs. The algorithm is easier to describe if we formulate the problem using a bipartite graph. Such placentas are described as bilobed/bilobular/bipartite, trilobed/trilobular/tripartite, and so on.