bigraph

基本解释

A new method (DM-decomposition of bigraph), for geometric constraint solving is proposed.
摘要提出了几何约束求解的新方法：偶图DM-分解法。
Taking the supplying regions as rows of the bigraph, the optimum scheme for looped grids feeder arrangement with minimum cost is obtained by a minimum weight match algorithm of bigraph.
以联络线的建设费用最小为目标函数,将各供电分区作为偶图的2列,采用最小权匹配算法得到"手拉手"环状网的最优配对结果。
bigraph (bipartite graph)
二部图,二部图形
complete bigraph
完全二部图; 完全双图
Some attributes for the mubtiple cartesian product graph of complete bigraph and circuits, A theorem for the binding number of multiple cartesian product graph of complete bigraph and circuits were presented and proven in this paper
本文给出并证明了完全偶图与多个圈的多重笛卡儿乘积图的一些性质及其联结数的一个计算公式。