2 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.LG2021★ 1 cited
The Automatic Quasi-clique Merger algorithm (AQCM)
Scott Payne, Edgar Fuller, George Spirou +1
The Automatic Quasi-clique Merger algorithm is a new algorithm adapted from early work published under the name QCM (quasi-clique merger) [Ou2006, Ou2007, Zhao2011, Qi2014]. The AQ…
cs.DS2020★ 2 cited
Edge-cuts Optimized for Average Weight: a new alternative to Ford and Fulkerson
Scott Payne, Edgar Fuller, Cun-Quan Zhang
Let be a directed graph associated with a weight . For an edge-cut of , the average weight of is denoted and defined as $w_{ave}(Q)=\frac{\s…
math.DG2010★ 1 cited
The Brylinski beta function of a surface
E. J. Fuller, M. K. Vemuri
An analogue of Brylinski's knot beta function is defined for a submanifold of d-dimensional Euclidean space. This is a meromorphic function on the complex plane. The first few resi…