1101 search results - page 169 / 221 » An Algorithm for the Graph Crossing Number Problem |
118
click to vote
WABI
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The existing synteny block reconstruction algorithms use anchors (e.g., orthologous genes) shared over all genomes to construct the synteny blocks for multiple genomes. T...
143
click to vote
ICDE
1993
IEEE
15 years 6 months ago
1993
IEEE
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
141
click to vote
IEEESCC
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
120
click to vote
COMPGEOM
1990
ACM
15 years 6 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
133
click to vote
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...