1101 search results - page 148 / 221 » An Algorithm for the Graph Crossing Number Problem |
135
Voted
GIS
2007
ACM
15 years 6 months ago
2007
ACM
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
135
click to vote
STOC
1996
ACM
15 years 6 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
134
Voted
ICDCS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
134
click to vote
PAMI
2007
15 years 2 months ago
2007
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
119
Voted
AAIM
2009
Springer
15 years 9 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...