Comparing Graph Layouts for Vertex Selection Tasks
Abstract
References
Index Terms
- Comparing Graph Layouts for Vertex Selection Tasks
Recommendations
Linear layouts measuring neighbourhoods in graphs
In this paper we introduce the graph layout parameter neighbourhood-width as a variation of the well-known cut-width. The cut-width of a graph G=(V,E) is the smallest integer k, such that there is a linear layout @f:V->{1,...,|V|}, such that for every 1=...
(d+1,2) -Track Layout of Bipartite Graph Subdivisions
A ( k ,2- track layout of a graph G consists of a 2- track assignment of G and an edge k -coloring of G with no monochromatic X-crossing . This paper studies the problem of ( k ,2)-track layout of bipartite graph subdivisions. Recently V.Dujmović and ...
Queue Layout of Bipartite Graph Subdivisions
For an integer d > 0, a d-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into d sets of non-nested edges with respect to the vertex ordering. Recently V. Dujmović and D. R. Wood showed that for every ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In

In-Cooperation
- SIGCHI: ACM Special Interest Group on Computer-Human Interaction
- HFESA: Human Factors and Ergonomics Society of Australia Inc.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 57Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in