This repo contains the technical report and source code for our SIGMOD submission, entitled ''A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery''.
response.pdf provides more experimental results of this work.
Programming Language: C++
Additional Programming Language Info:
Compiler Info: gcc version 7.5.0 (Ubuntu 7.5.0-3ubuntu1~18.04)
- Processor: 2
Intel(R) Xeon(R) Silver 4110 CPU @ 2.10GHzprocessors - Caches: 3 level caches (
512KiB L1 cache,8MiB L2 cache,11MiB L3 cache) for each processor - Memory:
256GiB System Memory(8 *32GiB DIMM DDR4 Synchronous 2666 MHz (0.4 ns)) - Secondary Storage: HDD,
6001GB TOSHIBA MG04ACA6, (interface speed:6.0 Gbit/s Max., rotation speed:7,200 rpm, average latency time:4.17 ms, buffer size:128 MiB, data transfer speed:205 MiB/s) write speed:210-280 MiB/s, read speed:320-350 MiB/s - Network: there is no network usage in our experiments
All datasets used in our experiments are from the KONECT and Network Repository. It seems KONECT is not no longer available. We provide the datasets used from KONECT in data-link.
After download and compile the code, the users can type ./DDSapp to see the usage of the program.
For example, ./DDSapp -g MO.txt -a a -e 1 is running CP-Approx on MO dataset with epsilon=1.
./DDSapp -g MO.txt -a e is running CP-Exact on MO dataset.