$c$-Packedness versus $\lambda$-Low-Density in Geometric Graphs: Theory and Practice

Gregor Diatzko, Félix Lasseux, Sabine Storandt

When designing algorithms for geometric graphs, exploiting structural parameters can lead to significantly improved bounds. Two prominent parameters in this context are $c$-packedn…