Finding a minimal spanning hypertree of a weighted hypergraph

DOI10.1007/S10878-022-00864-ZzbMATH Open1498.90202OpenAlexW4280604159MaRDI QIDQ2168776FDOQ2168776

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

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

zbMATH Keywords

graphcombinatorial optimizationhypergraphweighted graphweighted hypergraphminimal spanning graph

Mathematics Subject Classification ID

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

Cites Work

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

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)