آمار
| تعداد نشریات | 50 |
| تعداد شمارهها | 2,105 |
| تعداد مقالات | 19,492 |
| تعداد مشاهده مقاله | 23,062,149 |
| تعداد دریافت فایل اصل مقاله | 21,338,779 |
Graph Layout: Converting 1-Stack Layout to 2-Queue Layout | ||
| Journal of New Researches in Mathematics | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 18 تیر 1401 | ||
| نوع مقاله: research paper | ||
| شناسه دیجیتال (DOI): 10.30495/jnrm.2022.63259.2150 | ||
| نویسندگان | ||
Seehr Moradi1؛ Zahed Rahmati  2
| ||
| 1Graduated student, Department of Mathematics and Computer Science Amirkabir University of Technology - Tehran Polytechnic | ||
| 2Assistant Professor, Department of Mathematics and Computer Science, Amirkabir University of Technology | ||
| چکیده | ||
| The layout of a graph is finding a linear order for the vertices of the graph such that each of its edges is assigned to exactly one of the stacks (resp. queues) based on the properties of the stack (resp. queue). In this paper, we find a relationship between the stack layout and the queue layout of a graph. In particular, we provide an algorithm for converting a 1-stack layout of any graph into a 2-queue layout of the same graph, and we prove the correction of our algorithm. This method obtains the queue layout from a given stack layout without considering the graph itself and its properties. We hope by generalizing and developing this method one would achieve a queue number (i.e., the smallest number of the queues required by the queue layout of the graph) for some graph categories with almost the same upper and lower bound on their stack number. | ||
| کلیدواژهها | ||
| Graph Layout؛ Graph Drawing؛ Graph Stack layout؛ Graph Queue Layout | ||
|
آمار تعداد مشاهده مقاله: 119 |
||
