Upper and Lower Bounds on the Pagenumber of the Book Embedding of the k-ary Hypercube
| dc.contributor.author | Bettayeb, Said | |
| dc.date.accessioned | 2020-05-08T16:06:36Z | |
| dc.date.available | 2020-05-08T16:06:36Z | |
| dc.date.issued | 2009 | |
| dc.description.abstract | Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to build a VLSI chip is just one of the many areas in which graph embeddings are used. A type of embedding that is helpful in determining the number of layers is a book embedding. We develop upper and lower bounds on the pagenumber of a book embedding of the k-ary hypercube along with an upper bound on the cumulative pagewidth. | en_US |
| dc.identifier.citation | Upper and Lower Bounds on the Pagenumber of the Book Embedding of the k-ary hypercube, (with David Hoelzeman), Journal of Digital Information Management, Vol. 7 Issue 1, Feb. 2009, pp. 31-35. | en_US |
| dc.identifier.uri | https://hdl.handle.net/10657.1/2328 | |
| dc.publisher | Journal of Digital Information Management | en_US |
| dc.subject | Embedded Systems--Usage Very Large Scale Integration--Design and Construction | en_US |
| dc.title | Upper and Lower Bounds on the Pagenumber of the Book Embedding of the k-ary Hypercube | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Upper and Lower Bounds on the Pagenumber of teh Book Embedding.pdf
- Size:
- 7.44 KB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: