ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsComputational GeometryDirected Acyclic GraphsGraph AlgorithmsGraph DrawingGraph TheoryHypergraph TheoryDynamic Graph AnalysisHypergraph DrawingSteiner SystemsSteiner Tree Problem
Abstract. We report an experience on a practical system for drawing hypergraphs in the subset standard. The Patate system is based on the application of a classical force directed method to a dynamic graph, which is deduced, at a given iteration time, from the hypergraph structure and particular vertex locations. Different strategies to define the dynamic underlying graph are presented. We illustrate in particular the method when the graph is obtained by computing an Euclidean Steiner tree.
8
David Harel · Communications of the ACM · 1988 · 1.3K citations · Full text
On the Computational Complexity of Combinatorial Problems
Richard M. Karp · Networks · 1975 · 712 citations
Euclidean Steiner minimum trees: An improved exact algorithm
Paweł Winter, Martin Zachariasen · Networks · 1997 · 86 citations