We present a neural-network algorithm for minimizing edge crossings in drawings of nonplanar graphs. This is an important subproblem encountered in graph layout. The algorithm finds either theâ€¦ (More)

We present an empirical analysis of some heuristics for the graph thickness problem, i.e., decomposing a graph into the minimum number of planar subgraphs. The problem has applications in databaseâ€¦ (More)

Cimikowski, R.J., Properties of some Euclidean proximity graphs, Pattern Recognition Letters 13 (1992) 417-423. Some combinatorial properties of two planar Euclidean proximity graphs, the relativelyâ€¦ (More)

Interconnection networks play a vital role in parallel computing architectures. We investigate topological properties of some networks proposed for parallel computation, based on their underlyingâ€¦ (More)

The next high-priority phase of human genomics will involve the development of a full Haplotype Map of the human genome [15]. It will be used in large-scale screens of populations to associateâ€¦ (More)

We de Ì„ne a new model for adjacency subgraph selection for the facility layout problem based on proximity and present some heuristics for its solution. The new model presents a more realisticâ€¦ (More)

We deene the subvariance S P (F) of a family of graphs F with respect to property P to be the innmum of the ratio jH1j jH2j , where H 1 and H 2 are any two maximal spanning subgraphs of G withâ€¦ (More)