Indian Statistical Institute

Matrix Analysis

An Algorithm for the Traveling Salesman Problem

A “branch and bound” algorithm is presented for solving the traveling salesman problem. The set of all tours (feasible solutions) is broken up into increasingly small subsets by...

A Simple Method for Computing Resistance Distance

The resistance distance ri j between two vertices vi and vj of a (connected, molecular) graph G is equal to the effective resistance between the respective two points of an elec...

A Note on Distributional Properties of the Jöreskog-Sörbom Fit Indices

In introducing the LISREL model for systems of linear structural equations, Jöreskog and Sörbom proposed two goodness-of-fit indices, GFI and AGFI. Their asymptotic distribution...

ANGELS for distributed analytics in IoT

The current global emphasis on "Internet of Things (IoT)" have highlighted the extreme importance of sensor-based intelligent and ubiquitous systems which are more commonly know...