论文信息 - How to draw a hypergraph

How to draw a hypergraph

There is an increasing amount of applications in computer science and other fields in which hypergraphs are used. This paper shows that in many cases the problem of drawing a hypergraph can be reduced to the problem of drawing normal graphs. This holds true especially when considering hypergraphs drawing in the edge standard, i.e. when the hyperedges connecting the vertices are drawn as curves.

Erkki Mäkinen | E. Mäkinen

[1] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[2] Timothy R. S. Walsh,et al. Hypermaps versus bipartite maps , 1975 .

[3] Mitsuhiko Toda,et al. Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[4] Frank Harary,et al. Graph Theory , 2016 .

[5] Ronald Fagin,et al. Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.

[6] David S. Johnson,et al. Crossing Number is NP-Complete , 1983 .

[7] Giorgio Ausiello. Directed Hypergraphs: Data Structures and Applications , 1988, CAAP.

[8] James A. Storer,et al. On minimal-node-cost planar embeddings , 1984, Networks.

[9] Robert H. Henry,et al. Automatic layout of large directed graphs , 1988 .

[10] János Pach,et al. Small sets supporting fary embeddings of planar graphs , 1988, STOC '88.

[11] Lawrence A. Rowe,et al. A browser for directed graphs , 1987, Softw. Pract. Exp..

[12] Bernd Becker,et al. Layouts with Wires of Balanced Length , 1987, Inf. Comput..

[13] Erkki Mäkinen,et al. Experiments on drawing 2-level hierarchical graphs , 1990, Int. J. Comput. Math..

[14] David Harel,et al. On visual formalisms , 1988, CACM.

[15] Howard Trickey,et al. Drag: a graph drawing system , 1988 .

[16] David S. Johnson,et al. Hypergraph planarity and the complexity of drawing venn diagrams , 1987, J. Graph Theory.