Spatial clustering has been widely studied due to its application in several areas. However, the algorithms of such technique still need to overcome several challenges to achieve satisfactory results on a timely basis. ...

The spanning-tree approximation model is one of the models used for polymerizations with intramolecular reaction regardless of the size of the ring formed. We present a modification of this model that uses more accurate ...

Spanning trees are fundamental objects in graph theory. The spanning tree set size of an arbitrary graph can be very large. This limitation discourages its analysis. However interesting patterns can emerge in small cases. ...

Consider a connected graph G and let T be a spanning tree of G. Every edge e∈G−T induces a cycle in T∪{e}. The intersection of two distinct such cycles is the set of edges of T that belong to both cycles. We consider the ...

Spatial clustering has been widely studied due to its application in several areas. However, the algorithms of such technique still need to overcome several challenges to achieve satisfactory results on a timely basis. ...