205 citations · 1.2k across the 31 of their papers we have counts for
1 paper · 1 filter
Lovro Šubelj
A convex network can be defined as a network such that every connected induced subgraph includes all the shortest paths between its nodes. Fully convex network would therefore be a…