Finding a minimal spanning hypertree of a weighted hypergraph

DOI10.1007/S10878-022-00864-ZMaRDI QIDQ2168776zbMATH OpenOpenAlexFDO

Authors G. H. Shirdel, B. Vaez-Zadeh

Publication date 26 August 2022

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-022-00864-z

zbMATH Keywords

graphcombinatorial optimizationhypergraphweighted graphweighted hypergraphminimal spanning graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph theory (educational aspects) (97K30)

Recommendations

• Finding the shortest path for a hypergraph
• Approximation techniques for hypergraph partitioning problems
• Development of hypergraph theory
• Partial trees in weighted graphs-I
• Non-uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• A hypergraph extension of the bipartite Turán problem
• Connection and separation in hypergraphs
• Connectivity in hypergraphs
• Graph theory with applications
• Hypergraph Ramsey numbers
• Hypergraphs in which all disjoint pairs have distinct unions
• Introduction to graph and hypergraph theory
• Maximum hypergraphs without regular subgraphs
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• Regular subgraphs of uniform hypergraphs
• The maximum size of hypergraphs without generalized 4-cycles
• The weak hyperedge tenacity of the hypercycles
• Two-regular subgraphs of hypergraphs

Cited in

(4)

• Approximation techniques for hypergraph partitioning problems
• Finding the shortest path for a hypergraph
• Finding the \(N\) best vertices in an infinite weighted hypergraph
• What do trees and hypercubes have in common?

This page was built for publication: Finding a minimal spanning hypertree of a weighted hypergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168776)