Module subgraph_matching::graph_ops [−][src]
Functions
The k-core of a graph is a maximal subgraph in which
each node has at least degree k. The coreness of a
node is the highest order of a k-core containing the
node, i.e., node u has coreness c if it belongs
to a c-core but not to any (c + 1)-core.