1. Bipartite Graph is important data structure for data base system etc.

2. And we analyzed the statistical properties of the bipartite graph and competition network with the complex network theory and methods.

3. Inthis method, a bipartite graph structure is used to track potentially intersecting faces.

4. This scheduling algorithm takes the bipartite graph matching and the backtracking techniques as mathematical tools.

5. A complete bipartite graph is a simple bipartite graph with bipartition.

6. The architecture is represented by a bipartite graph and its relation with a general graph is also discussed.

7. Particularly, we propose a two-phase spectral bigraph co-clustering approach for bipartite graph.

8. By the graph representation, we discuss the girth and diameter of a bipartite graph, and their roles in improving the efficiency of decoding algorithms and the performance of the code.

9. An improved Boolean matching algorithm based on transforming the mapping between Boolean variables into the problem of perfect matching of bipartite graph is presented.

10. An expression among the data nodes, storage nodes and query nodes is set up and proved via bipartite graph theory,() which is directive in wireless sensor network with limited energy efficiency.

11. G is said to be bipartite matching extendable (BM-extendable) if every matching M whose induced subgraph is a bipartite graph extends to a perfect matching of G.

12. The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained.

13. Base on above, applying direct product operation principle to build formula for finding all composite graph directed_tree's bipartite graph.

14. Based on duality theory of linear programming and graph theory, it is proved that the matching game defined on a bipartite graph has the stable core if and only if the graph has a perfect matching.

15. The theory involved takes its reference from the Matching of Bipartite Graph theory.

16. This article gives a solution to the programming 0-1 problem whose objective function is a nonlinear function, by applying weighted bipartite graph and perfect matching.

17. In this paper, the algorithm is introduced on using bipartite graph to build mathematical model and to solve division between teachers and classes in the design of arranging-lessons system.

18. In this paper, a new method for image retrial using color moments of partitions and minimum cost perfect matching for a weighted bipartite graph based on im.

19. Based on the fault information matrix obtained from the bipartite graph model and the Boolean algebra system, a MINLP model orienting sensors optimization is proposed.

20. The Hungarian Algorithm is a method for finding the maximum matching, while the Kuhn-Munkres Algorithm suggests a method of seeking the best matching in the complete weighted Bipartite Graph.

21. Then, we propose a genetic algorithm based method, which is used to explore the optimal removal of some redundant vias to get a conflict-free bipartite graph for double via insertion.