O(n log n) algorithm renders unit circular arc intersection graphs edgeless and k-clique-free; GGED is strongly NP-hard on unweighted interval graphs and on d-balls/d-cubes for d >= 2.
Boundary labeling in a circular orbit
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
O(n log n) algorithm renders unit circular arc intersection graphs edgeless and k-clique-free; GGED is strongly NP-hard on unweighted interval graphs and on d-balls/d-cubes for d >= 2.