1 citations · 2 across the 6 of their papers we have counts for
3 papers · 1 filter
Transit Functions and Clustering Systems
Manoj Changat, Ameera Vaheeda Shanavas, Peter F. Stadler
Transit functions serve not only as abstractions of betweenness and convexity but are also closely connected with clustering systems. Here, we investigate the canonical transit fun…
Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs
Ameera Vaheeda Shanavas, Manoj Changat, Marc Hellmuth +1
We investigate the connections between clusters and least common ancestors (LCAs) in directed acyclic graphs (DAGs). We focus on the class of DAGs having unique least common ancest…
Directed graphs and its Boundary Vertices
Manoj Changat, Prasanth G. Narasimha-Shenoi, Mary Shallet T. J +1
Suppose that is a strongly connected digraph. Let . The maximum distance is defined as =max\{$\overrightarrow{d}(u,v), \overrightarrow{d}…