NDLI: Laying Out Graphs Using Queues

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Rosenberg, Arnold L. Heath, Lenwood S.
Copyright Year	1992
Abstract	The problem of laying out the edges of a graph using queues is studied. In a k-queue layout, vertices of the graph are placed in some linear order and each edge is assigned to exactly one of the k queues so that the edges assigned to each queue obey a first-in/first-out discipline. This layout problem abstracts a design problem of fault-tolerant processor arrays, a problem of sorting with parallel queues, and a problem of scheduling parallel processors. A number of basic results about queue layouts of graphs are established, and these results are contrasted with their analogues for stack layouts of graphs (the book-embedding problem). The 1-queue graphs (they are almost leveled-planar graphs) are characterized. It is proved that the problem of recognizing 1-queue graphs is NP-complete. Queue layouts for some specific classes of graphs are given. Relationships between the queuenumber of a graph and its bandwidth and separator size are presented. An apparent tradeoff between the queuewidth and the number of queues allowed in layouts of complete binary trees is indicated.
Starting Page	927
Ending Page	958
Page Count	32
File Format	PDF
ISSN	00975397
DOI	10.1137/0221055
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	5
Volume Number	21
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2006-07-13
Access Restriction	Subscribed
Subject Keyword	fault-tolerant computing bandwidth graph embedding Graph theory book embedding Complexity classes queue layout Analysis of algorithms and problem complexity NP-completeness Applications of graph theory stack layout separators scheduling parallel processors
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Stack and Queue Layouts of Directed Acyclic Graphs: Part II

Comparing Queues and Stacks As Machines for Laying Out Graphs

Stack and Queue Layouts of Directed Acyclic Graphs: Part I

Stack and queue layouts of directed acyclic graphs: part i (1996).

Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design

Stack And Queue Layouts Of Directed Acyclic Graphs (Extended Abstract) (1993)

Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages

Stack and Queue Layouts of Posets

Transversals of Vertex Partitions in Graphs

Laying Out Graphs Using Queues

Similar Documents

Stack and Queue Layouts of Directed Acyclic Graphs: Part II

Comparing Queues and Stacks As Machines for Laying Out Graphs

Stack and Queue Layouts of Directed Acyclic Graphs: Part I

Stack and queue layouts of directed acyclic graphs: part i (1996).

Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design

Stack And Queue Layouts Of Directed Acyclic Graphs (Extended Abstract) (1993)

Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages

Stack and Queue Layouts of Posets

Transversals of Vertex Partitions in Graphs

Laying Out Graphs Using Queues