215 search results - page 21 / 43 » Approximating Geometrical Graphs via |
103
Voted
STOC
2006
ACM
16 years 2 days ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
114
click to vote
TCBB
2011
14 years 6 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
111
click to vote
ICPR
2006
IEEE
16 years 26 days ago
2006
IEEE
We present a model of a `gas of circles', the ensemble of regions in the image domain consisting of an unknown number of circles with approximately fixed radius and short ran...
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
116
click to vote
ESA
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...