Find Paper, Faster
Example:10.1021/acsami.1c06204 or Chem. Rev., 2007, 107, 2411-2502
Finding a minimal spanning hypertree of a weighted hypergraph
Journal of Combinatorial Optimization  (IF1.262),  Pub Date : 2022-05-12, DOI: 10.1007/s10878-022-00864-z
G. H. Shirdel, B. Vaez-Zadeh

A hypergraph has a complex structure, which is why some re- searchers seek to transform the hypergraph into a graph. In this paper, we present two corresponding graphs for each hypergraph and naming them in the Clique graph and the Persian graph. They have a simpler structure than the graph, and it is easier to work with these graphs. Using these graphs, we are looking for minimal spanning hypertree for the hypergraph.