Hypergraphs for Covering Trees and Approximating Steiner Trees
Source abstract
Abstract
This article presents a particular tree covering technique. To cover a set of nodes belonging to an unknown tree, a set of connected small Steiner trees is proposed. These Steiner trees can be represented as hyperedges, and a... | Find, read and cite all the research you need on Tech Science Press
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Complexity and Algorithms in Graphs · Advanced Graph Theory Research · Graph Theory and Algorithms
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References
Reference metadata was not supplied for this record.