Finding a minimal spanning hypertree of a weighted hypergraph,Journal of Combinatorial Optimization

当前位置： X-MOL 学术 › J. Comb. Optim. › 论文详情

Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)

Finding a minimal spanning hypertree of a weighted hypergraph
Journal of Combinatorial Optimization ( IF 0.9 ) Pub Date : 2022-05-12 , DOI: 10.1007/s10878-022-00864-z
G. H. Shirdel ₁ , B. Vaez-Zadeh ₁

Affiliation

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.

中文翻译：