Computing the Shortest Essential Cycle ∗ (2009)
An essential cycle on a surface is a simple cycle that cannot be continuously deformed to a point or a single boundary. We describe algorithms to compute the shortest essential cycle in an orientable...
Arijit Mukhopadhyay, Saptarshi Biswas, Pratik Worah, Ramasish Das
Recent developments in embedded systems technology have opened up a vast area of research and development- the development of portable and affordable assistive devices tuned to specific applications...
The Hub Number of a Graph (2008)
Tracy Grauman, Stephen G. Hartke, Bill Kinnersley, Douglas B. West, Lesley Wiglesworth, Pratik Worah, ...
A hub set in a graph G is a set U ⊆ V (G) such that any two vertices out-side U are connected by a path whose internal vertices lie in U. We prove that h(G) ≤ hc(G) ≤ γc(G) ≤ h(G) + 1, where...
Testing Contractibility in Planar Rips Complexes ∗ (2008)
Erin W. Chambers, Jeff Erickson, Pratik Worah
The (Vietoris-)Rips complex of a discrete point-set P is an abstract simplicial complex in which a subset of P defines a simplex if and only if the diameter of that subset is at most 1. We describe...
Computing the shortest essential cycle (2008)
An essential cycle on a surface is a simple cycle that cannot be continuously deformed to a point or a single boundary. We describe algorithms to compute the shortest essential cycle in an orientable...
Computing the shortest essential cycle (2008)
A non-contractible cycle is a simple cycle that cannot be deformed to a point. An essential cycle is a non-contractible cycle that cannot be deformed to a boundary on the surface. One of the first...