Queue Layouts and Staircase Covers of Matrices
1994) Queue Layouts and Staircase Covers of Matrices. Technical Report ncstrl.vatech_cs//TR-94-22, Computer Science, Virginia Polytechnic Institute and State University. (
Full text available as: |
Abstract
A connection between a queue layout of an undirected graph and a staircase cover of its adjacency matrix is established. The connection is exploited to establish a number of combinatorial results relating the number of vertices, the number of edges, and the queue number of a queue layout. The staircase notion is generalized to that of an (h,w)- staircase, and an efficient algorithm to optimally cover a matrix with (h,w)- staircases is presented. The algorithm is applied to problems of monotonic subsequences and to the maxdominance problem of Atallah and Kosaraju.
Item Type: | Departmental Technical Report |
---|---|
Subjects: | Computer Science > Historical Collection(Till Dec 2001) |
ID Code: | 404 |
Deposited By: | User autouser |
Deposited On: | 05 December 2001 |
Alternative Locations: | URL:ftp://ei.cs.vt.edu/pub/TechnicalReports/1994/TR-94-22.ps.gz, URL:http://historical.ncstrl.org/tr/ps/vatech_cs/TR-94-22.ps |