Is there a simple algorithm for efficient decomposition on this special kind of graph?
Tree decomposition for planar nearest neighbor graphs
3
$\begingroup$
graph-theory