895 search results - page 58 / 179 » Using graphs for some discrete tomography problems |
ASIACRYPT
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. Frey and R¨uck gave a method to transform the discrete logarithm problem in the divisor class group of a curve over Fq into a discrete logarithm problem in some finite ...
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
FSTTCS
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
AAAI
2004
14 years 11 days ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
ICALP
2003
Springer
14 years 4 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...