A new class of separators and planarity of chordal graphs

We introduce a new class of clique separators, called base sets, for chordal graphs. Base sets of a chordal graph closely reflect its structure. We show that the notion of base sets leads to structural characterizations of planar k-trees and planar chordal graphs. Using these characterizations, we develop linear time algorithms for recognizing planar k-trees and planar chordal graphs. These algorithms are extensions of the Lexicographic_Breadth_First_Search algorithm for recognizing chordal graphs and are much simpler than the general planarity checking algorithm. Further, we use the notion of base sets to prove the equivalence of hamiltonian 2-trees and maximal outerplanar graphs.

Direct detection of Salmonella without pre-enrichment in milk, ice-cream and fruit juice by PCR against hilA gene

A novel PCR based assay was devised to specifically detect contamination of any Salmonella serovar in milk, fruit juice and ice-cream without pre-enrichment. This method utilizes primers against hilA gene which is conserved in all Salmonella serovars and absent from the close relatives of Salmonella. An optimized protocol, in terms time and money, is provided for the reduction of PCR contaminants from milk, ice-cream and juice through the use of routine laboratory chemicals. The simplicity, efficiency (time taken 3-4 h) and sensitivity (to about 5-10 CFU/ml) of this technique confers a unique advantage over other previously used time consuming detection techniques. This technique does not involve pre-enrichment of the samples or extensive sample processing, which was a pre-requisite in most of the other reported studies. Hence, this assay can be ideal for adoption, after further fine tuning, by food quality control for timely detection of Salmonella contamination as well as other food-borne pathogens (with species specific primers) in food especially milk, ice-cream and fruit juice. (C) 2011 Elsevier Ltd. All rights reserved.

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties

We study the problem of finding small s-t separators that induce graphs having certain properties. It is known that finding a minimum clique s-t separator is polynomial-time solvable (Tarjan in Discrete Math. 55:221-232, 1985), while for example the problems of finding a minimum s-t separator that induces a connected graph or forms an independent set are fixed-parameter tractable when parameterized by the size of the separator (Marx et al. in ACM Trans. Algorithms 9(4): 30, 2013). Motivated by these results, we study properties that generalize cliques, independent sets, and connected graphs, and determine the complexity of finding separators satisfying these properties. We investigate these problems also on bounded-degree graphs. Our results are as follows: Finding a minimum c-connected s-t separator is FPT for c=2 and W1]-hard for any ca parts per thousand yen3. Finding a minimum s-t separator with diameter at most d is W1]-hard for any da parts per thousand yen2. Finding a minimum r-regular s-t separator is W1]-hard for any ra parts per thousand yen1. For any decidable graph property, finding a minimum s-t separator with this property is FPT parameterized jointly by the size of the separator and the maximum degree. Finding a connected s-t separator of minimum size does not have a polynomial kernel, even when restricted to graphs of maximum degree at most 3, unless .

Numerical simulation of conductive particle behaviour at the surface of a plate electrode affected by a DC corona field

The electric field in certain electrostatic devices can be modeled by a grounded plate electrode affected by a corona discharge generated by a series of parallel wires connected to a DC high-voltage supply. The system of differential equations that describe the behaviour (i.e., charging and motion) of the conductive particle in such an electric field has been numerically solved, using several simplifying assumptions. Thus, it was possible to investigate the effect of various electrical and mechanical factors on the trajectories of conductive particles. This model has been employed to study the behaviour of coalparticles in fly-ash corona separators.

Miconazole in the treatment of superficial mycoses

Miconazole nitrate (2%) cream was evaluated in the treatment of superficial mycoses. Out of 116 patients having multiple clinical diagnoses, 66 cases were found to be positive by culture. Species of Trichophyton were the predominant etiological agents (in over 60%) followed by Candida species (20%) and Epidermophyton floccosum (15%). All the cases selected for study were followed up to a period of 4–18 months. A cure rate of 94.6 per cent was observed in all the cases where causal organisms were isolated. Significantly high cure rate (66%) was also seen in cases where causal organisms could not be isolated, including cases of tinea versicolor. Results of mycological examination were in confirmity with the clinical results

Enhancing 'Mobility' through Integrated Transportation and Traffic Management

During the course of preparation of a master plan for the transportation networks in Bangalore city, mapping the various initiatives and interventions planned towards addressing mobility, existing situation and implications of some of the proposed interventions was analysed. The inferences are based on existing transportation network; synthesis of various transportation related studies and proposed infrastructure initiatives (road works) in Bangalore. Broadly, they can be summarized as following five aspects: I. Need for ~Sreclassifying~T existing road networks (arterial and sub-arterial) with effective geospatial database in the back-end. II. The proposed Core Ring Road at surface grade may not be feasible. III. Current interventions encouraging more independent motorable transport by way of road widening, construction of underpasses, flyovers and grade-separators would not ease traffic congestion when addressed in isolation. IV. Factors affecting time and cost-overruns in infrastructure projects and ways to tackle are discussed. V. Initiatives required for addressing effective planning for operations recommended.

Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms

A spanning tree T of a graph G is said to be a tree t-spanner if the distance between any two vertices in T is at most t times their distance in G. A graph that has a tree t-spanner is called a tree t-spanner admissible graph. The problem of deciding whether a graph is tree t-spanner admissible is NP-complete for any fixed t >= 4 and is linearly solvable for t <= 2. The case t = 3 still remains open. A chordal graph is called a 2-sep chordal graph if all of its minimal a - b vertex separators for every pair of non-adjacent vertices a and b are of size two. It is known that not all 2-sep chordal graphs admit tree 3-spanners This paper presents a structural characterization and a linear time recognition algorithm of tree 3-spanner admissible 2-sep chordal graphs. Finally, a linear time algorithm to construct a tree 3-spanner of a tree 3-spanner admissible 2-sep chordal graph is proposed. (C) 2010 Elsevier B.V. All rights reserved.