Drawing Hypergraphs in the Subset Standard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1984, Issue , 2001, Pages 164-169

  Bertault, François ^a   Eades, Peter ^b  

^a Tom Sawyer Software   (United States)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; DRAWING (GRAPHICS); ITERATIVE METHODS; TREES (MATHEMATICS);

DYNAMIC GRAPH; EUCLIDEAN; FORCE-DIRECTED METHOD; HYPER GRAPH; PRACTICAL SYSTEMS; STEINER TREES; UNDERLYING GRAPHS; VERTEX LOCATIONS;

GRAPH THEORY;

EID: 84903847468     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_15     Document Type: Conference Paper

References (10)

1. F. Bertault. A force-directed algorithm that preserves edge-crossing properties. Information Processing Letters, 74(1-2):7-13, 2000.
2. T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21(11):1129-1164, 1991.
3. D. Harel. On visual formalisms. Communications of the ACM, 31(5):514-530, 1988.
4. D. S. Johnson and H. O. Pollak. Hypergraph planarity and the complexity of drawing venn diagrams. Journal of Graph Theory, 1987.
5. R. M. Karp. On the computational complexity of combinatorial problems. Networks, 5:45-68, 1975.
6. H. Klemetti, I. Lapinleimu, E. Mäkinen and M. Sieranta. A programming project: Trimming the spring algorithm for drawing hypergraphs. SIGCSE Bulletin, 27(3):34-38, 1995.
7. E. Mäkinen. How to draw a hypergraph. International Journal of Computer Mathematics, 1990.
8. K. Mehlhorn and S. Naher. LEDA, a Platform for Combinatorial and Geometric Computing. Communications of the ACM, 38(1):96-102, 1995.
9. John Venn. On the diagrammatic and mechanical representation of propositions and reasonings. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 9:1-18, 1880.
10. P. Winter and M. Zachariasen. Euclidean steiner minimum trees: An improved exact algorithm. Networks, 30:149-166, 1997.