feedback-arc-set

该项目是基于C++实现了最小反馈弧集问题的三种近似算法——GreedyFAS、SortFAS、PageRankFAS

This reposity includes code and data for paper https://arxiv.org/html/2412.16181v1. The original data are from https://github.com/SherylHYX/GNNRank, but I have converted the graphs to edge list format, and have put them here.

Training-free ranking from pairwise comparisons via acyclic graph construction (MWFAS-based). Accepted, The Journal of Supercomputing (2026).

Implementation of the paper "Computing a Feedback Arc Set Using PageRank"

Raw research workspace: genetic/heuristic feedback-arc-set experiments and Wulver HPC batch runs on connectome and other large graphs.

Exploratory research code (2025): hybrid interval-based refinement heuristic for large-scale weighted feedback arc set on connectome graphs (Python, multiprocessing, 12/24/48-core runs).

IPSNS: incumbent-protected SCC neighborhood search for minimum weighted feedback arc set on sparse digraphs. Manuscript in preparation (SN Computer Science).

It is the codes

Code to reproduce experiments for a local-ratio heuristic for minimal feedback arc set in weighted directed graphs (DIMACS/graph-benchmarks).

Consistency-aware ranking from pairwise preferences: cyclic preference-graph repair (MWFAS), retrieval evaluation, and statistical-inference methodology. Companion code for a manuscript submitted to SN Computer Science.