Ara
Toplam kayıt 2, listelenen: 1-2
Crossing minimization in weighted bipartite graphs
(Springer, 2007)
Given a bipartite graph G = (L-0, L-1, E) and a fixed ordering of the nodes in L-0, the problem of finding an ordering of the nodes in L-1 that minimizes the number of crossings has received much attention in literature. ...
Force-directed approaches to sensor localization
(SIAM, 2006)
We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information ...