lecfab Goto Github PK

acm

approx-triangle-counting

Approximating the number of triangles in a graph by sampling only a few "low-hinge" wedges

bashmarks

Directory bookmarks for the shell

busyweaver.github.io

certifvc

Quality certification for Vertex Cover: fast C++ heuristic that uses a lower-bounding technique to prove the quality of a small cover on large graphs.

cuisine

cv_fr

Latex generator for my up-to-date research resume in French.

dicg

diplomap

Carte évolutive de la situation sécuritaire mondiale vue par la diplomatie française.

edmonds-blossom-algorithm

A C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs

fastvc

Vertex Cover implementation by Shaowei Cai (http://lcs.ios.ac.cn/~caisw/VC.html)

hercules

Gaining advanced insights from Git repository history.

js-base64

Base64 implementation for JavaScript

kamis

Maximum independent sets and vertex covers of large sparse graphs, taken from https://karlsruhemis.github.io/

kcliquelisting

a k-cliques algorithm

lecfab

lecfab.github.io

m1courses

m1if2sem

Git du M1IF du second semestre à l'ENS Lyon

megaprez

Générateur de présentation pour Mega-Search

mrremind

The mrremind packages contains data preprocessing for the REMIND model.

musique

Partitions et travaux d'écriture

piamvalidation

pmu-tools

Intel PMU profiling tools

remind

REMIND - REgional Model of INvestments and Development

remind2

The remind2 package contains the REMIND-specific routines for data and model output manipulation.

rescience-gorder

This is the source code of the 2021 replication for ReScience of the paper "Speedup Graph Processing by Graph Ordering" by Hao Wei, Jeffrey Xu Yu, Can Lu, and Xuemin Lin, published in Proceedings of SIGMOD 2016.

specter

SPECTER: Document-level Representation Learning using Citation-informed Transformers

streamfig

Python class to generate describe stream graphs in fig format

tipe

Bon, on sait tous de quoi on parle...