バイパータイト・グラフのマッチング変換

概要

論文の詳細を見る
A matching transformation has been defined between two complete matchings of a bipartite graph, Where the bipartite graph corresponds to a certain matrix and each complete matching corresponds to each term of the determinant. Here, some structural properties of the set of complete matchings were investigated, and a method for generating the set of complete matchings by the matching transformation was introduced. Simultaneously, the properties of a circult in a bipartite graph was discussed with respect to the alternation of a matching edge and a non-matching edge.
一般社団法人情報処理学会の論文
1971-07-15