Last update: Wed Sep 26 02:07:32 MDT 2018
@Article{Klemetti:1995:PPT,
author = "Harri Klemetti and Ismo Lapinleimu and Erkki
M{\"a}kinen and Mika Sieranta",
title = "A programming project: trimming the spring algorithm
for drawing hypergraphs",
journal = j-SIGCSE,
volume = "27",
number = "3",
pages = "34--38",
month = sep,
year = "1995",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/209849.209855",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 18:57:31 MST 2012",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
abstract = "Graph drawing problems provide excellent material for
programming projects. As an example, this paper
describes the results of an undergraduate project which
dealt with hypergraph drawing. We introduce a practical
method for drawing hypergraphs. The method is based on
the spring algorithm, a well-known method for drawing
normal graphs.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}