GitHub - tsourolampis/triangle-densest-subgraph-problem: Code from WWW'15 paper

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
IO.h		IO.h
README		README
TrianglePeel.cpp		TrianglePeel.cpp
hash.h		hash.h
new-airports.txt		new-airports.txt
runExperiments.sh		runExperiments.sh
runmeTriangle.bat		runmeTriangle.bat

Repository files navigation

Description
-----------

Peeling algorithm for the triangle densest subgraph problem. 
The algorithm appears in 
http://people.seas.harvard.edu/~babis/kcliqueDSP.pdf
and was used to produce the results in the WWW’15 paper 

Instructions
------------ 

Compile: g++ TrianglePeel.cpp -o TrianglePeel -std=gnu++0x -O3
Demo: ./TrianglePeel.exe < airport.txt > airport.log
Author: Charalampos E. Tsourakakis,


— 

Provided for academic use only. For non-academic/commercial use contact 
Charalampos E. Tsourakakis  [email protected]