Finding a Box Representation for a Graph in $O(n^2\Delta^2\ln n)$ time

An axis-parallel box in $b$-dimensional space is a Cartesian product $R_1 \times R_2 \times \cdots \times R_b$ where $R_i$ (for $1 \leq i \leq b$) is a closed interval of the form $[a_i, b_i]$ on the real line. For a graph $G$, its boxicity is the minimum dimension $b$, such that $G$ is representable as the intersection graph of (axis-parallel) boxes in $b$-dimensional space. The concept of boxicity finds application in various areas of research like ecology, operation research etc. Chandran, Francis and Sivadasan gave an $O(\Delta n^2 \ln^2 n)$ randomized algorithm to construct a box representation for any graph $G$ on $n$ vertices in $\lceil (\Delta + 2)\ln n \rceil$ dimensions, where $\Delta$ is the maximum degree of the graph. They also came up with a deterministic algorithm that runs in $O(n^4 \Delta )$ time. Here, we present an $O(n^2 \Delta^2 \ln n)$ deterministic algorithm that constructs the box representation for any graph in $\lceil (\Delta + 2)\ln n \rceil$ dimensions.

Scan cell reordering to minimize peak power during test cycle: A graph theoretic approach

Scan circuit is widely practiced DFT technology. The scan testing procedure consist of state initialization, test application, response capture and observation process. During the state initialization process the scan vectors are shifted into the scan cells and simultaneously the responses captured in last cycle are shifted out. During this shift operation the transitions that arise in the scan cells are propagated to the combinational circuit, which inturn create many more toggling activities in the combinational block and hence increases the dynamic power consumption. The dynamic power consumed during scan shift operation is much more higher than that of normal mode operation.

Evolving Random Geometric Graph Models for Mobile Wireless Networks

We consider evolving exponential RGGs in one dimension and characterize the time dependent behavior of some of their topological properties. We consider two evolution models and study one of them detail while providing a summary of the results for the other. In the first model, the inter-nodal gaps evolve according to an exponential AR(1) process that makes the stationary distribution of the node locations exponential. For this model we obtain the one-step conditional connectivity probabilities and extend it to the k-step case. Finite and asymptotic analysis are given. We then obtain the k-step connectivity probability conditioned on the network being disconnected. We also derive the pmf of the first passage time for a connected network to become disconnected. We then describe a random birth-death model where at each instant, the node locations evolve according to an AR(1) process. In addition, a random node is allowed to die while giving birth to a node at another location. We derive properties similar to those above.

A Kinematic Theory for Planar Hoberman and Other Novel Foldable Mechanisms

In this paper, we present a kinematic theory for Hoberman and other similar foldable linkages. By recognizing that the building blocks of such linkages can be modeled as planar linkages, different classes of possible solutions are systematically obtained including some novel arrangements. Criteria for foldability are arrived by analyzing the algebraic locus of the coupler curve of a PRRP linkage. They help explain generalized Hoberman and other mechanisms reported in the literature. New properties of such mechanisms including the extent of foldability, shape-preservation of the inner and outer profiles, multi-segmented assemblies and heterogeneous circumferential arrangements are derived. The design equations derived here make the conception of even complex planar radially foldable mechanisms systematic and easy. Representative examples are presented to illustrate the usage of the design equations and the kinematic theory.

Reversible Formation of a Planar Chiral Ferrocenylboroxine and Its Supramolecular Structure

The boronic acid (pS)-1,2-NpFcB(OH)(2) (1) was obtained by treatment of the lithiated species (pS)-1,2-NpFcLi with B(O(i)Pr)(3), followed by acidic workup; subsequent dehydration gave the enantiomerically pure boroxine [(pS)-1,2-NpFcBO](3) (2) in 49% isolated yield. Multinuclear and 2D NMR spectroscopies, single-crystal X-ray diffraction, and elemental analysis served to confirm the structure of 2. In the solid-state structure, all three of the naphthyl groups point in one direction and all of the ferrocenyl moieties are placed on the opposite face of the boroxine ring, which is also the preferred conformation in solution according to a (1)H, (1)H-NOESY experiment. Cyclic voltammetry revealed three separate reversible oxidation events, which suggests significant communication between the ferrocenyl moieties. These redox processes experience a cathodic shift upon addition of 4-dimethylaminopyridine (DMAP) as a Lewis base. The six-membered ring is opened upon treatment with hot CHCl(3)/MeOH to form the methoxy species (pS)-1,2-NpFcB(OH)(OMe) (3), which can be converted back to the cycle 2 by dissolution in wet CHCl(3), followed by column chromatography on silica gel.

Acyclic edge coloring of 2-degenerate graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). A graph is called 2-degenerate if any of its induced subgraph has a vertex of degree at most 2. The class of 2-degenerate graphs properly contains seriesparallel graphs, outerplanar graphs, non - regular subcubic graphs, planar graphs of girth at least 6 and circle graphs of girth at least 5 as subclasses. It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a'(G)<=Delta + 2, where Delta = Delta(G) denotes the maximum degree of the graph. We prove the conjecture for 2-degenerate graphs. In fact we prove a stronger bound: we prove that if G is a 2-degenerate graph with maximum degree ?, then a'(G)<=Delta + 1. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 68:1-27, 2011

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.

Whole arm manipulation using closed and hybrid planar chains: A kinematic study

This paper studies planar whole arm manipulation of a circular object using closed loop and hybrid manipulators. The manipulation is simple with fewer degrees of actuation than the task space. This is an useful operation if the initial and final positions of the object are on the same surface. Closed loop manipulator is a 4/5 bar mechanism. In hybrid manipulators a open loop manipulator with 3/4 links is attached to the floating link of 4/5 bar mechanism. The mobility analysis is carried out to find the connectivity of the object with reference to frame. The manipulation (forward kinematics) starts from a given configuration of the object and the manipulator. In hybrid manipulators determination of initial configuration involves inverse kinematics of open loop manipulator. The input joint velocities are used to demonstrate the manipulation. Conditions are specified for prehensile manipulation.