Property testing in graph theory concerns the design of sublinear‐time algorithms that, given query access to a large graph, swiftly distinguish between the case where the graph satisfies a global ...
Correlation clustering is a framework for partitioning the nodes of a graph according to pairwise similarity and dissimilarity labels on edges. Rather than fixing the number of clusters in advance, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results