Algorithm 2.
Main steps for generating pairable sets. Here (V, E) is the input graph with V the set of nodes, and E the set of edges. pi(u) is the set of nodes pairable with u computed up to step i (> 0).
|
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.