731 search results - page 99 / 147 » Reductions to Graph Isomorphism |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
ICS
1993
Tsinghua U.
14 years 28 days ago
1993
Tsinghua U.
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
CSB
2005
IEEE
14 years 2 months ago
2005
IEEE
A genetic map is an ordering of genetic markers constructed from genetic linkage data for use in linkage studies and experimental design. While traditional methods have focused on...
GD
2003
Springer
14 years 2 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...