Betzler Nadja

Nadja Betzler

Information about the author Nadja Betzler will soon be added to the site.
Found 3 papers in total
Separator-based data reduction for signed graph balancing
Separator-based data reduction for signed graph balancing
2010
Polynomial-time data reduction is a classical approach to hard graph problems....
Experiments on data reduction for optimal domination in networks
Experiments on data reduction for optimal domination in networks
2006
We present empirical results on computing optimal dominating sets in networks by means...
Tree decompositions of graphs: Saving memory in dynamic programming
Tree decompositions of graphs: Saving memory in dynamic programming
2006
We propose a simple and effective heuristic to save memory in dynamic programming on...
Papers per page: