In recent years, significant advances have been made in the design and analysis of fully dynamic maximal matching algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the algorithms are implemented and tested on real datasets, and their practical potential is far from understood. Here, we provide a start to bridge the gap between theory and practice that is currently observed for the fully dynamic maximal matching problem. We engineer several algorithms and empirically study those algorithms on an extensive set of dynamic instances. We provide an overview talk over the algorithms contained in the framework here. If you just want to have a look at slides explaining the algorithms, you can click here. Experimental results and indepth descriptions of the algorithms can be found here.
You can download DynMatch with the following command line:
git clone https://github.com/DynGraphLab/DynMatchTo compile the codes, just type
./compile_withcmake.sh. In this case, all binaries, libraries and headers are in the folder ./deploy/
Alternatively use the standard cmake build process:
mkdir build
cd build
cmake ../ -DCMAKE_BUILD_TYPE=Release
make
cd ..dynmatch FILE [options].
This is a brief overview of the most important options.
FILE
Path to graph file that you maintain a dynamic matching for.
-help
Print help.
-seed=<int>
Seed to use for the random number generator.
--algorithm=TYPE
One of {staticblossom, dynblossom, randomwalk, neimansolomon, baswanaguptasen}
-eps=<double>
Epsilon. Limit search depth of random walk or augmenting path search in dynblossom to 2/eps-1.
--dynblossom_lazy
Only start augmenting path searchs after x newly inserted edges on an endpoint.
--dynblossom_maintain_opt
Maintain optimum in dynblossom. (Without this option the algorithm is called UNSAFE)
-measure_graph_only
Only measure graph construction time.
The main folder contains example dynamic sequences in the example folder. Here are the first couple of lines of munmun_digg.undo.0.1.seq. The first number after the # is the number of nodes that the graph has (at most) and the next number is the number of updates that are performed. Then in each line is one operation. The first number is 1 if an edge is inserted and 0 if an edge is deleted. The two numbers after that are the corresponding end points of the respective edge.
# 30399 87627
1 1 2
1 51 52
1 91 92
1 124 125
1 34 35
1 152 153
The program is licenced under MIT licence. If you publish results using our algorithms, please acknowledge our work by quoting the following paper:
@inproceedings{DBLP:conf/esa/Henzinger0P020,
author = {Monika Henzinger and
Shahbaz Khan and
Richard Paul and
Christian Schulz},
title = {Dynamic Matching Algorithms in Practice},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
pages = {58:1--58:20},
year = {2020},
crossref = {DBLP:conf/esa/2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.58},
doi = {10.4230/LIPIcs.ESA.2020.58},
timestamp = {Wed, 26 Aug 2020 16:56:07 +0200},
biburl = {https://dblp.org/rec/conf/esa/Henzinger0P020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2020,
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
isbn = {978-3-95977-162-7},
timestamp = {Wed, 26 Aug 2020 16:29:43 +0200},
biburl = {https://dblp.org/rec/conf/esa/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
