6 citations · 8 across the 11 of their papers we have counts for
4 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…
Spiders can be recognized by counting their legs
Sarah Berkemer, Ricardo Chaves, Adrian Fritz +3
Spiders are arthropods that can be distinguished from their closest relatives, the insects, by counting their legs. Spiders have 8, insects just 6. Spider graphs are a very restric…
The Relaxed Square Property
Marc Hellmuth, Tilen Marc, Lydia Ostermeier +1
Graph products are characterized by the existence of non-trivial equivalence relations on the edge set of a graph that satisfy a so-called square property. We investigate here a ge…