Finding a minimal spanning hypertree of a weighted hypergraph

G. H. Shirdel () and B. Vaez-Zadeh
Additional contact information
G. H. Shirdel: University of Qom
B. Vaez-Zadeh: University of Qom

Journal of Combinatorial Optimization, 2022, vol. 44, issue 1, No 40, 894-904

Abstract: Abstract 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.

Keywords: Combinatorial optimization; Graph; Hypergraph; Weighted graph; Weighted hypergraph; Minimal spanning graph; 97K30 (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00864-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:1:d:10.1007_s10878-022-00864-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00864-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().