Part of the DynGraphLab — Dynamic Graph Algorithms open source framework. Developed at the Algorithm Engineering Group, Heidelberg University.

Python Interface: An easy-to-use Python interface for this software is available in CHSZLabLib.

A fully dynamic algorithm for the NP-complete maximum weight and maximum cardinality independent set problem. We introduce optimal neighborhood exploration, a novel local search technique that creates independent subproblems solved to optimality, leading to improved overall solutions. Applications include dynamic map labeling and vehicle routing.

The algorithm features a parameter (subproblem size) that balances running time and solution quality.

brew install DynGraphLab/dyngraphlab/dynwmis

Then run:

dynwmis FILE --algorithm=DynamicOneFast

git clone https://github.com/DynGraphLab/DynWMIS
cd DynWMIS
./compile_withcmake.sh

All binaries are placed in ./deploy/. Alternatively, use the standard CMake process:

mkdir build && cd build
cmake ../ -DCMAKE_BUILD_TYPE=Release
make && cd ..

dynwmis FILE [options]

./deploy/dynwmis examples/4elt.graph.seq --algorithm=DynamicOneFast
./deploy/dynwmis examples/4elt.graph.seq --algorithm=DynamicOneStrong

To convert a METIS graph file into the dynamic sequence format:

./deploy/dynwmis_convert_metis_seq nameofgraphfile.graph

Edge list format. The first line starts with # n m [weighted] where n is the number of nodes, m is the number of updates, and an optional 1 indicates a weighted graph. For weighted graphs, the next n lines specify vertex weights. Updates follow: 1 u v for edge insertion, 0 u v for edge deletion. Vertex IDs start at 1.

# 100 500
1 1 2
1 3 4
0 1 2

For weighted graphs:

# 100 500 1
10
20
...
1 1 2

The program is licensed under the MIT License. If you publish results using our algorithms, please acknowledge our work by citing the following paper:

@inproceedings{DBLP:conf/alenex/BorowitzG025,
  author       = {Jannick Borowitz and
                  Ernestine Gro{\ss}mann and
                  Christian Schulz},
  title        = {Optimal Neighborhood Exploration for Dynamic Independent Sets},
  booktitle    = {27th Symposium on Algorithm Engineering and Experiments, {ALENEX} 2025},
  pages        = {1--14},
  publisher    = {{SIAM}},
  year         = {2025},
  doi          = {10.1137/1.9781611978339.1}
}