The concepts of the undirected and directed decompositions are introduced for a hyperedge.Then, the recursive formulas of the underected decomposition set SD(m) and directed decomposition set SPD(m) are derived for an...The concepts of the undirected and directed decompositions are introduced for a hyperedge.Then, the recursive formulas of the underected decomposition set SD(m) and directed decomposition set SPD(m) are derived for an m-vertex hyperedge.Furthermore,the recursive formulas of their cardinalities|SD(m)|and |SPD(m)| are yielded.展开更多
A new branch of hypergraph theory-directed hyperaph theory and a kind of new methods-dicomposition contraction(DCP, PDCP and GDC) methods are presented for solving hypernetwork problems.lts computing time is lower tha...A new branch of hypergraph theory-directed hyperaph theory and a kind of new methods-dicomposition contraction(DCP, PDCP and GDC) methods are presented for solving hypernetwork problems.lts computing time is lower than that of ECP method in several order of magnitude.展开更多
文摘The concepts of the undirected and directed decompositions are introduced for a hyperedge.Then, the recursive formulas of the underected decomposition set SD(m) and directed decomposition set SPD(m) are derived for an m-vertex hyperedge.Furthermore,the recursive formulas of their cardinalities|SD(m)|and |SPD(m)| are yielded.
文摘A new branch of hypergraph theory-directed hyperaph theory and a kind of new methods-dicomposition contraction(DCP, PDCP and GDC) methods are presented for solving hypernetwork problems.lts computing time is lower than that of ECP method in several order of magnitude.
