| dc.contributor.advisor |
Stojmenovic, Ivan, |
en |
| dc.contributor.author |
Kapoor, Nidhi. |
en |
| dc.date.accessioned |
2009-03-23T17:40:07Z |
|
| dc.date.available |
2009-03-23T17:40:07Z |
|
| dc.date.created |
1999 |
en |
| dc.date.issued |
2009-03-23T17:40:07Z |
|
| dc.identifier.citation |
Source: Masters Abstracts International, Volume: 38-05, page: 1324. |
en |
| dc.identifier.isbn |
9780612481565 |
en |
| dc.identifier.uri |
http://hdl.handle.net/10393/8918 |
|
| dc.description.abstract |
A "book-embedding" of a graph G comprises of embedding the graph's nodes along the spine of a book, and embedding the edges on the pages so that the edges embedded on the same page do not intersect. This is also referred to as the page model. The "pagenumber" of a graph is the thickness of the smallest (in number of pages) book into which G can be embedded. A literature review of the one dimensional pagenumber problem is presented, and several two dimensional pagenumber models are proposed. Evolutionary computing methods on problems whose solution space comprises of permutations are reviewed. Since the pagenumber problem is known to be NP-complete, we describe two solutions using Hill Climbing methods and one solution using Genetic Algorithms for one and two-dimensional models. Two two-dimensional models are considered namely the square and rook models. We have given a unified framework for all three pagenumber models, in which a solution is a pair of two permutations (of nodes and edges), and which differ only by criteria for edge intersections. Experimental results on several kinds of graphs are then given. |
en |
| dc.format.extent |
133 p. |
en |
| dc.publisher |
University of Ottawa (Canada). |
en |
| dc.subject.classification |
Computer Science. |
en |
| dc.title |
Pagenumber problem. |
en |
| dc.type |
M.C.S.Thesis (M.C.S.)--University of Ottawa (Canada), 1999. |
en |
