Finding a minimal spanning hypertree of a weighted hypergraph (Q2168776)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a minimal spanning hypertree of a weighted hypergraph |
scientific article; zbMATH DE number 7576507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a minimal spanning hypertree of a weighted hypergraph |
scientific article; zbMATH DE number 7576507 |
Statements
Finding a minimal spanning hypertree of a weighted hypergraph (English)
0 references
26 August 2022
0 references
combinatorial optimization
0 references
graph
0 references
hypergraph
0 references
weighted graph
0 references
weighted hypergraph
0 references
minimal spanning graph
0 references
0.7521485686302185
0 references
0.6857559084892273
0 references
0.6830715537071228
0 references
0.6820458769798279
0 references
0.6804161071777344
0 references
