On minimizing width in linear layouts
Discrete Applied Mathematics
Cluster analysis for hypertext systems
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
An algorithm for finding homogeneous pairs
Discrete Applied Mathematics
SIAM Journal on Computing
A survey of graph layout problems
ACM Computing Surveys (CSUR)
On Bipartite Drawings and the Linear Arrangement Problem
SIAM Journal on Computing
Minimizing Width in Linear Layouts
Proceedings of the 10th Colloquium on Automata, Languages and Programming
A Polyhedral Approach to Planar Augmentation and Related Problems
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Graph Theory With Applications
Graph Theory With Applications
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the relationship between NLC-width and linear NLC-width
Theoretical Computer Science
Bimodular decomposition of bipartite graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.04 |
The neighbourhood-width of a graph G=(V,E) is introduced in [F. Gurski, Linear layouts measuring neighbourhoods in graphs, Discrete Math. 306 (15) (2006) 1637-1650.] as the smallest integer k such that there is a linear layout @f:V-{1,...,|V|} such that for every 1=i. In this paper we show first bounds for the neighbourhood-width of general graphs, caterpillars, trees and grid graphs and give applications of the layout parameter neighbourhood-width in graph drawing and VLSI design.