Abhiruk Lahiri

Learn More
A piecewise linear simple curve in the plane made up of k+1 line segments, each of which is either horizontal or vertical, with consecutive segments being of different orientation is called a k-bend path. Given a graph G, a collection of k-bend paths in which each path corresponds to a vertex in G and two paths have a common point if and only if the(More)
A pair of non-adjacent edges is said to be separated in a circular ordering of vertices, if the endpoints of the two edges do not alternate in the ordering. The circular separation dimension of a graph G, denoted by π◦(G), is the minimum number of circular orderings of the vertices ofG such that every pair of non-adjacent edges is separated in at least one(More)
  • 1