Pinned Repositories
ACM
approx-triangle-counting
Approximating the number of triangles in a graph by sampling only a few "low-hinge" wedges
cuisine
diplomap
Carte évolutive de la situation sécuritaire mondiale vue par la diplomatie française.
lecfab.github.io
musique
Partitions et travaux d'écriture
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.
velibrairie
Outil pour analyser vos déplacements à Vélib' en toute simplicité.
volt
Vertex Ordering to List Triangles: a fast C++ tool for triangle counting or listing in big graphs. See associated paper: https://arxiv.org/abs/2203.04774
remind
REMIND - REgional Model of INvestments and Development
lecfab's Repositories
lecfab/volt
Vertex Ordering to List Triangles: a fast C++ tool for triangle counting or listing in big graphs. See associated paper: https://arxiv.org/abs/2203.04774
lecfab/velibrairie
Outil pour analyser vos déplacements à Vélib' en toute simplicité.
lecfab/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.
lecfab/diplomap
Carte évolutive de la situation sécuritaire mondiale vue par la diplomatie française.
lecfab/lecfab.github.io
lecfab/musique
Partitions et travaux d'écriture
lecfab/approx-triangle-counting
Approximating the number of triangles in a graph by sampling only a few "low-hinge" wedges
lecfab/bashmarks
Directory bookmarks for the shell
lecfab/busyweaver.github.io
lecfab/dicg
lecfab/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.
lecfab/CV_fr
Latex generator for my up-to-date research resume in French.
lecfab/edgeTransport
A detailed transport sector model.
lecfab/edmonds-blossom-algorithm
A C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs
lecfab/FastVC
Vertex Cover implementation by Shaowei Cai (http://lcs.ios.ac.cn/~caisw/VC.html)
lecfab/hercules
Gaining advanced insights from Git repository history.
lecfab/KaMIS
Maximum independent sets and vertex covers of large sparse graphs, taken from https://karlsruhemis.github.io/
lecfab/kCliqueListing
a k-cliques algorithm
lecfab/lecfab
lecfab/M1Courses
lecfab/madrat
R package | May All Data be Reproducible and Transparent (MADRaT)
lecfab/mip
Model intercomparison visualization package
lecfab/mrremind
The mrremind packages contains data preprocessing for the REMIND model.
lecfab/piamValidation
lecfab/pmu-tools
Intel PMU profiling tools
lecfab/remind
REMIND - REgional Model of INvestments and Development
lecfab/remind2
The remind2 package contains the REMIND-specific routines for data and model output manipulation.
lecfab/specter
SPECTER: Document-level Representation Learning using Citation-informed Transformers
lecfab/streamfig
Python class to generate describe stream graphs in fig format
lecfab/WeGotYouCovered
Exact Vertex Cover algorithm, taken from https://zenodo.org/record/2816116