Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Fink, Simon Dominik"'
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is NP-hard, we i
Externí odkaz:
http://arxiv.org/abs/2411.15864
Autor:
Marktscheffel, Tobias, Gottschlich, Wolfram, Popp, Wolfgang, Werli, Philemon, Fink, Simon Dominik, Bilzhause, Arne, de Meer, Hermann
Publikováno v:
2016 IEEE 17th International Symposium on A World of Wireless, Mobile & Multimedia Networks (WoWMoM); 2016, p1-6, 6p
