3 citations · 5 across the 6 of their papers we have counts for
6 papers
Global Least Common Ancestor (LCA) Networks
Anna Lindeberg, Bruno J. Schmidt, Manoj Changat +3
Directed acyclic graphs (DAGs) are fundamental structures used across many scientific fields. A key concept in DAGs is the least common ancestor (LCA), which plays a crucial role i…
Directed Transit Functions
Arun Anil, Manoj Changat, Lekshmi Kamal K-Sheela +5
Transit functions were introduced as models of betweenness on undirected structures. Here we introduce directed transit function as the directed analogue on directed structures suc…
Convex Geometries yielded by Transit Functions
Manoj Changat, Lekshmi Kamal K. Sheela, Iztok Peterin +1
Let be a finite nonempty set. A transit function is a map such that , and hold for every . A…
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…
Transit Functions and Pyramid-Like Binary Clustering Systems
Manoj Changat, Ameera Vaheeda Shanavas, Peter F. Stadler
Binary clustering systems are closely related to monotone transit functions. An interesting class are pyramidal transit functions defined by the fact that their transit sets form a…