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
本文給出竝証明了完全偶圖與多個圈的多重笛卡兒乘積圖的一些性質及其聯結數的一個計算公式。