1101 search results - page 158 / 221 » An Algorithm for the Graph Crossing Number Problem |
147
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...
133
Voted
IWPEC
2004
Springer
15 years 8 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
109
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
138
Voted
DCOSS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
128
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...