1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
Smooth weakly modular graphs
Victor Chepoi, Bruno J. Schmidt, Peter F. Stadler
A graph is called smooth (respectively, strongly smooth) if for any two vertices , the distance point-shadow , respect…
Smooth Graphs
Boštjan Brešar, Manoj Changat, Prasanth G. Narasimha-Shenoi +2
The notion of smoothness was introduced originally in the context of step systems on connected graphs. Smoothness turns out to be a very general property of metrics defined by a fi…
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…