当前位置: 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 1 , B. Vaez-Zadeh 1
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.



中文翻译:

找到加权超图的最小生成超树

超图具有复杂的结构,这就是为什么一些研究人员寻求将超图转换为图的原因。在本文中,我们为每个超图呈现了两个对应的图,并将它们命名为 Clique 图和波斯图。它们具有比图更简单的结构,并且使用这些图更容易。使用这些图,我们正在寻找超图的最小生成超树。

更新日期:2022-05-13
down
wechat
bug