2 citations · 2 across the 2 of their papers we have counts for
5 papers
On Testability of First-Order Properties in Bounded-Degree Graphs
Isolde Adler, Noleen Köhler, Pan Peng
We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree graph and relational structure models. We show that any FO property that…
Augmenting the Algebraic Connectivity of Graphs
Bogdan-Adrian Manghiuc, Pan Peng, He Sun
For any undirected graph and a set of candidate edges with , the -spectral augmentability problem is to find a set of edges from…
Average Sensitivity of Spectral Clustering
Pan Peng, Yuichi Yoshida
Spectral clustering is one of the most popular clustering methods for finding clusters in a graph, which has found many applications in data mining. However, the input graph in tho…
More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization
Jakob Bossek, Frank Neumann, Pan Peng +1
Dynamic optimization problems have gained significant attention in evolutionary computation as evolutionary algorithms (EAs) can easily adapt to changing environments. We show that…
Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time
Hendrik Fichtenberger, Mingze Gao, Pan Peng
We present a simple sublinear-time algorithm for sampling an arbitrary subgraph \emph{exactly uniformly} from a graph with edges, to which the algorithm has access by p…