4 citations · 5 across the 5 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CG2023
Minimum Star Partitions of Simple Polygons in Polynomial Time
Mikkel Abrahamsen, Joakim Blikstad, André Nusser +1
We devise a polynomial-time algorithm for partitioning a simple polygon into a minimum number of star-shaped polygons. The question of whether such an algorithm exists has been…
cs.CC2023
NP-Hardness of Tensor Network Contraction Ordering
Jianyu Xu, Hanwen Zhang, Ling Liang +3
We study the optimal order (or sequence) of contracting a tensor network with a minimal computational cost. We conclude 2 different versions of this optimal sequence: that minimize…