direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments


Our software
short description
A tool for analyzing the combinatorial structure of graphs by computation and estimation of various graph parameters.
  • webpage [1]
Incremental Graph Coloring
An implementation of serveral commonly used heuristic algorithms for the (vertex) graph coloring problem together with a new proposed search tree based algorithm that is based on "incremental coloring".

  • license [2]
  • readme [3]
  • binary [4]
  • source [5]
  • benchmark [6]
Tool for computing Kemeny rankings by using efficient polynomial-time data reduction rules combined with several exact algorithms. Can solve meaningful real-world instances with more than 100 candidates within milliseconds.
  • C++ source code [7]
  • linux binaries [8]
  • readme [9]
  • license [10]
  • test data [11]
  • background paper [12]
Tool for computing maximum mu-cliques.
  • Haskell source code and data [13]
Tool for finding maximum s-plexes.
  • oCaml source code [14]
  • readme [15]
  • background paper [16]
Temporal cliques
Tool for enumerating all maximal cliques in a temporal graph
  • Source code [17]
Pattern-Guided k-Anonymity
Heuristic and exact ILP implementation to solve Pattern-Guided k-Anonymity. The collection includes the scripts and datasets used in the paper.
  • experiments [18]
Heuristic and exact ILP implementation including the random instance generator. Binaries are created on 64bit Debian.
  • heuristic source [19]
  • heuristic binary [20]
  • heuristic readme [21]
  • ILP source [22]
  • ILP binary [23]
  • real world data [24]
Implementations of both the naive and the cluster boundary based SAT-Solving approach.
  • Python scripts and data sets [25]
Parliamentary voting procedures
Implementations for both Manipulation and Agenda Control for the amendment procedure and the successive procedure.
  • C++ source code [26]
  • readme [27]
Highly Connected Deletion
This package contains the source and the test data for a solver for
the Highly Connected Deletion problem.
  • readme [28]
  • data+code [29]
Well-connected 2-club
Tool for finding well-connected 2-clubs. The implementation can find the support the t-robust, t-hereditary,  and the t-connected 2-club model.
  • source code + program [30]
  • readme [31]
Implementation of a Dynamic Program computing a mean of time series in dynamic time warping spaces.
  • Java source code [32]
Maximum Matching
Implementations of both weighted and unweighted reduction rules for maximum matching.
  • C++ source code [33]
Dynamic Temporal Graph Warping
Implementation of the dtgw-distance algorithms.
  • Python package [34]
Isolated Temporal Cliques
Enumeration algorithm for isolated temporal cliques.
  • Python code [35]
Cluster Editing
Java-Implementation for transforming a given input graph into a cluster graph (disjoint union of cliques) with a minimum number of edge modifications.
  • Implementation & readme [36]
Persistent graphs
Enumeration of persistent graphs.
  • Rust code [37]
Binary DTW-Mean
Implementation of fast DTW-Mean algorithms for binary data.
  • Python source code [38]
Implementation of fast exact DTW for run-length encoded time series.
  • C++ source code [39]
------ Links: ------

Zusatzinformationen / Extras