Rengarajan, S and Madhavan, Veni CE (1995) Stack and queue number of 2-trees. In: Proceedings of First Annual International Conference, COCOON'95, 24-26 Aug. 1995, Xi'an, China, pp. 203-212.
Full text not available from this repository. (Request a copy)
Official URL: http://www.springerlink.com/content/d4w17v152186n5...
Abstract
We consider the two problems of embedding graphs in a minimum number of pages and ordering the vertices of graphs in the form of queue layouts. We show that the class of 2-trees requires 2-pages for a book embedding and 3-queues for a queue layout. The first result is new and the latter result extends known results on subclasses of planar graphs
| Item Type: | Conference Paper |
|---|---|
| Publisher: | Springer-Verlag |
| Additional Information: | Copyright of this article belongs to Springer-Verlag. |
| Keywords: | stack;queue number;2-trees;embedding graphs;vertices of graphs;2-pages;book embedding;queue layout |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 18 Sep 2007 |
| Last Modified: | 11 Jan 2012 06:13 |
| URI: | http://eprints.iisc.ac.in/id/eprint/10928 |
Actions (login required)
 |
View Item |
