• Greedy algorithm for the densest subgraph problem. The algorithm appears in "Greedy approximation algorithms for finding dense components in a graph" In International Workshop on Approximation Algorithms for Combinatorial Optimization (pp. 84-95), 2000.

• Greedy algorithm for the optimal quasi-clique problem. The algorithm appears in "Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees" In Proceedings of the 19th International Conference on Knowledge Discovery and Data Mining (pp. 104-112), 2012.

• Greedy algorithm for the triangle densest subgraph problem. The algorithm appears in "The k-clique densest subgraph problem" In Proceedings of the 24th International Conference on World Wide Web (pp. 1122-1132), 2015.

• Greedy algorithm for the triangle-graph densest subgraph problem. The algorithm appears in "K-clique-graphs for Dense Subgraph Discovery", https://arxiv.org/pdf/1610.06008.pdf

GML files: python greedy_algorithms.py adjnoun.gml

Edgelist format: python greedy_algorithms.py com-amazon.ungraph.txt

Keyword extraction: python keyword_extraction.py

—

Provided for academic use only