#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1994

1995

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Co-author

#### Journals and Conferences

Learn More

This paper introduces genetic algorithms for the level permutation problem (LPP). The problem is to minimize the number of edge crossings in a bipartite graph when the order of vertices in one of the two vertex subsets is fixed. We show that genetic algorithms outperform the previously known heuristics especially when applied to low density graphs. Values… (More)

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.

- ‹
- 1
- ›