Page Number Problem: An Evaluation of Heuristics and Its Solution Using a Hybrid Evolutionary Algorithm

The page number problem is to determine the minimum number of pages in a book in which a graph G can be embedded with the vertices placed in a sequence along the spine and the edges on the pages of the book such that no two edges cross each other in any drawing. In this paper, the authors have statistically evaluated five heuristics for ordering vertices on the spine for minimum number of edge crossings with all the edges placed in a single page, statistically evaluated four heuristics for distributing edges on a minimum number of pages with no crossings for a fixed ordering of vertices on the spine and implemented and experimentally evaluated a Hybrid Evolutionary Algorithm (HEA) for solving the page number problem.

Provided by: Academy & Industry Research Collaboration Center Topic: Software Date Added: Apr 2012 Format: PDF

Find By Topic