Algorithm 1.
Find core subgraph
| Input: Graph G, Vertex subset V (τ), maximum p-value of interest maxPvalue |
| Output: Vertex subset core(τ) |
| root ←HierchicalClustering(V (τ)) |
| return DivideCluster(root, maxPvalue) |
Official websites use .gov
A
.gov website belongs to an official
government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you've safely
connected to the .gov website. Share sensitive
information only on official, secure websites.