Optimal hypergraph tree-realization

Ephraim Korach, Margarita Razgon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Consider a hyperstar H and a function w assigning a non-negative weight to every unordered pair of vertices of H and satisfying the following restriction: for any three vertices u,v,x such that u and v belong to the same set of hyperedges, ω({u,x}) = ω({v,x}). We provide an efficient method that finds a tree-realization T of H which has the maximum weight subject to the minimum number of leaves. We transform the problem to the construction of an optimal degree-constrained spanning arborescence of a non-negatively weighted directed acyclic graph (DAG). The latter problem is a special case of the weighted matroid intersection problem. We propose a faster method based on finding the maximum weighted bipartite matching.

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 31st International Workshop, WG 2005, Revised Selected Papers
Number of pages10
StatePublished - 1 Dec 2005
Event31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2005 - Metz, France
Duration: 23 Jun 200525 Jun 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3787 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Optimal hypergraph tree-realization'. Together they form a unique fingerprint.

Cite this