1 citations · 1 across the 5 of their papers we have counts for
Showing 2024 · cs.DSShow all
2 papers · 2 filters
cs.DS2024
Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
Tom Davot, Jessica Enright, Jayakrishnan Madathil +1
A graph G is c-closed if every two vertices with at least c common neighbors are adjacent to each other. Introduced by Fox, Roughgarden, Seshadhri, Wei and Wein [ICALP 2018, SICOMP…
cs.DS2024★ 1 cited
Parameterized Algorithms for Balanced Cluster Edge Modification Problems
Jayakrishnan Madathil, Kitty Meeks
We study {\sc Cluster Edge Modification} problems with constraints on the size of the clusters. A graph is a cluster graph if every connected component of is a clique. In a…