Efficient ($\alpha$$\alpha$,$\beta$$\beta$)-core computation in bipartite graphs

Graph format

A .meta file contains the number of edges and the number of nodes in each part. See data/example.meta a .e file contains all the edges. See data/example.e

xxxxxxxxxx
3
1
data
2
├── example.e
3
├── example.meta

Build index

To build index with BasicDecom:

xxxxxxxxxx
1
1
./abcore -BasicDecom path_to_graph (e.g. ./abcore -BasicDecom ../data/example)

To build index with ComShrDecom:

xxxxxxxxxx
1
1
./abcore -ComShrDecom path_to_graph (e.g. ./abcore -ComShrDecom ../data/example)

To build index with ParallelDecom:

xxxxxxxxxx
1
1
./abcore -ParallelDecom path_to_graph num_cores (e.g. ./abcore -ParallelDecom ../data/example 20)

Querying

To query alpha beta core using BiCoreIndex:

xxxxxxxxxx
1
1
./abcore -Query path_to_graph alpha beta (e.g. ./abcore -Query ../data/example 2 3)

Dynamic operations

To insert edge with BiCore-Index-Ins:

xxxxxxxxxx
1
1
./abcore -BiCore-Index-Ins path_to_graph vertex_1 vertex_2 (e.g. ./abcore -BiCore-Index-Ins ../data/example 3 6)

To remove edge with BiCore-Index-Rem:

xxxxxxxxxx
1
1
./abcore -BiCore-Index-Rem path_to_graph vertex_1 vertex_2 (e.g. ./abcore -BiCore-Index-Rem ../data/example 3 7)

To insert edge with BiCore-Index-Ins*:

xxxxxxxxxx
1
1
./abcore -BiCore-Index-Ins* path_to_graph vertex_1 vertex_2 (e.g. ./abcore -BiCore-Index-Ins* ../data/example 3 6)

To remove edge with BiCore-Index-Rem*:

xxxxxxxxxx
1
1
./abcore -BiCore-Index-Rem* path_to_graph vertex_1 vertex_2 (e.g. ./abcore -BiCore-Index-Rem* ../data/example 3 7)

To insert edge with ParallelIns:

xxxxxxxxxx
1
1
./abcore -ParallelIns path_to_graph vertex_1 vertex_2 num_cores (e.g. ./abcore -BiCore-Index-Ins* ../data/example 3 6 20)

To remove edge with ParallelRem:

xxxxxxxxxx
1
1
./abcore -ParallelRem path_to_graph vertex_1 vertex_2 num_cores (e.g. ./abcore -BiCore-Index-Rem* ../data/example 3 7 20)