Download JAR files tagged by bipartite with all dependencies
sets from group de.cit-ec.tcs.alignment (version 3.1.1)
This module provides algorithms to compare sets, that is, order-invariant lists. These
algorithms are implementations of the AlignmentAlgorithm interface defined in the
algorithms module.
In particular, this module contains the StrictSetAlignmentScoreAlgorithm for computing
the cost of the optimal unordered alignment of two sets, the
StrictSetAlignmentFullAlgorithm which provides the Alignment itself as well, and the
GreedySetAlignmentScoreAlgorithm as well as the GreedySetAlignmentFullAlgorithm for
computing a potentially sub-optimal but faster alignment of two sets.
The optimal alignments rely on the HungarianAlgorithm for solving the assignment
problem in bipartite graphs. Here, we rely on the implementation provided by Kevin L. Stern
which is provided within this distribution.
0 downloads
Artifact sets
Group de.cit-ec.tcs.alignment
Version 3.1.1
Last update 26. October 2018
Organization not specified
URL http://openresearch.cit-ec.de/projects/tcs
License The GNU Affero General Public License, Version 3
Dependencies amount 1
Dependencies algorithms,
There are maybe transitive dependencies!
Group de.cit-ec.tcs.alignment
Version 3.1.1
Last update 26. October 2018
Organization not specified
URL http://openresearch.cit-ec.de/projects/tcs
License The GNU Affero General Public License, Version 3
Dependencies amount 1
Dependencies algorithms,
There are maybe transitive dependencies!
Page 1 from 1 (items total 1)