You can download from here some of the codes we described in our publications. We hope these codes will be helpful for a reader to better understand our papers, and/or to reproduce/check the results in our manuscripts.

Caution: There is no guarantee that these codes are correct. If you find any mistakes in these codes, we will be very grateful to know.

  1. Optimal network attack problem.
    BPD-guided attack algorithm (updated on 28.03.2016):
    TAbyFVSbpdV03.cpp
    zhjrandom.h
    ERn100kM1m.g100 (example graph instance)

  2. Directed Feedback Vertex Set (DFVS) problem.
    BPD (belief propagation-guided decimation) algorithm (updated on 08.05.2016):
    DFVSbpdV04.cpp
    zhjrandom.h
    RRRa10n10k.g00 (example directed graph instance)

  3. Undirected Feedback Vertex Set (FVS) problem.
    BPD (belief propagation-guided decimation) algorithm (updated on 08.09.2015):
    FVSbpdV01.cpp
    zhjrandom.h
    ERn100kM1m.g100 (example graph instance)

  4. Feedback arc set (FAS) problem.
    Simulated annealing (updated on 09.07.2017):
    FASbySAv01.cpp or FASbySAv02.cpp
    BPD (belief propagation-guided decimation) algorithm (updated on 24.10.2016):
    FASmodelBbpdV02.cpp
    zhjrandom.h
    Graph example courtesy of Dr. Yuhan Chen: Celegans_Chen_Yuhan.dat

  5. Undirected Dominating Set (DS) problem.
    BPD (belief propagation-guided decimation) algorithm (updated on 02.10.2014)
    DSbpdV03.cpp
    An efficient local greedy algorithm (updated on 30.09.2014)
    GLRandGreedyDSV02b.cpp
    zhjrandom.h
    ERn100kM1m.g100 (example graph instance)