{"id":13080,"date":"2021-12-05T20:53:16","date_gmt":"2021-12-06T01:53:16","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=13080"},"modified":"2026-06-02T14:59:24","modified_gmt":"2026-06-02T18:59:24","slug":"tr-03-04-new-results-in-graph-layout","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2003\/tr-03-04-new-results-in-graph-layout\/","title":{"rendered":"TR-03-04: New Results in Graph Layout"},"content":{"rendered":"\n
\n
\n\n
\n
\n
\n

\n TR-03-04: New Results in Graph Layout\n <\/h1>\n \n \n <\/header>\n\n <\/div>\n\n <\/div>\n\n <\/div>\n<\/section>\n\n

Carleton University
\nTechnical Report<\/a> TR-03-04
\nJune 2003<\/p>\n\n\n\n

New Results in Graph Layout<\/h2>\n\n\n\n
\n
\n
\n
\n
\n
\n
\n
\n
Vida Dujmovic & David Wood<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

Abstract<\/h3>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n

A track layout of a graph consists of a vertex colouring, an edge colouring, and a total or- der of each vertex colour class such that between each pair of vertex colour classes, there is no monochromatic pair of crossing edges. This paper studies track layouts and their applica- tions to other models of graph layout. In particular, we improve on the results of Enomoto and Miyauchi [ SIAM J. Discrete Math. , 1999] regarding stack layouts of subdivisions, and give anal- ogous results for queue layouts. We solve open problems due to Felsner, Wismath, and Liotta [ Proc. Graph Drawing , 2001] and Pach, Thiele, and Toth [ Proc. Graph Drawing , 1997] concern- ing three-dimensional straight-line grid drawings. We initiate the study of three-dimensional polyline grid drawings and establish volume bounds within a logarithmic factor of optimal.<\/p>\n\n\n\n

TR-03-04.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Carleton University Technical Report TR-03-04 June 2003 New Results in Graph Layout Vida Dujmovic & David Wood Abstract A track layout of a graph consists of a vertex colouring, an edge colouring, and a total or- der of each vertex colour class such that between each pair of vertex colour classes, there is no monochromatic […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":12314,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-13080","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13080","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=13080"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13080\/revisions"}],"predecessor-version":[{"id":13081,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13080\/revisions\/13081"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12314"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=13080"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=13080"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}