How to draw a hypergraph
- 1 January 1990
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 34 (3-4) , 177-185
- https://doi.org/10.1080/00207169008803875
Abstract
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.Keywords
This publication has 13 references indexed in Scilit:
- On visual formalismsCommunications of the ACM, 1988
- Small sets supporting fary embeddings of planar graphsPublished by Association for Computing Machinery (ACM) ,1988
- Hypergraph planarity and the complexity of drawing venn diagramsJournal of Graph Theory, 1987
- Layouts with wires of balanced lengthInformation and Computation, 1987
- A browser for directed graphsSoftware: Practice and Experience, 1987
- Drawing plane graphs nicelyActa Informatica, 1985
- On minimal‐node‐cost planar embeddingsNetworks, 1984
- Crossing Number is NP-CompleteSIAM Journal on Algebraic Discrete Methods, 1983
- Degrees of acyclicity for hypergraphs and relational database schemesJournal of the ACM, 1983
- Hypermaps versus bipartite mapsJournal of Combinatorial Theory, Series B, 1975