Learn More
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maintain a user's mental picture of the original layout. We present a new approach to layout adjustment called cluster busting in anchored graph drawing. We then give two algorithms as(More)
We give processor-allocation algorithms for grid architec-tures, where the objective is to select processors from a set of available processors to minimize the average number of communication hops. The associated clustering problem is as follows: Given n points in d , find a size-k subset with minimum average pairwise L1 distance. We present a natural(More)
We give processor-allocation algorithms for grid architec-tures, where the objective is to select processors from a set of available processors to minimize the average number of communication hops. The associated clustering problem is as follows: Given n points in d , find a size-k subset with minimum average pairwise L1 distance. We present a natural(More)
A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f = e) is inserted such that the resulting object belongs to the same class as the original object. In this paper, we consider Hamiltonian planar paths as geometric objects. A technique is presented for transforming a given planar(More)
EEcient interprocessor communication is crucial to increasing the performance of parallel computers. In this paper, a special framework is developed on the generalized hypercube, a network that is currently receiving considerable attention. Using this framework as the basic tool, a number of spanning graphs with special properties to t various communication(More)
Motivated by rectangular visibility and graph drawing applications, we study the problem of characterizing classes of graphs that admit rectangle of innuence drawings. We consider several classes of graphs and show, for each class, that testing whether a graph G has a rectangle of innuence drawing can be done in O(n) time, where n is the number of vertices(More)
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is connected. G is a planar support if it is a support and planar. Johnson and Pollak [11] proved that it is NP-complete to decide if a given hypergraph has a planar support. In contrast,(More)
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing is called the track number of G. In [18] it is proved that every graph from a proper minor closed family has constant track number if and only if it has constant queue number. In(More)
It is widely accepted that (1) the natural or folded state of proteins is a global energy minimum, and (2) in most cases proteins fold to a unique state determined by their amino acid sequence. The H-P (hydrophobic-hydrophilic) model is a simple combinatorial model designed to answer qualitative questions about the protein folding process. In this paper we(More)