220 search results - page 7 / 44 » Reconstruction Algorithm for Permutation Graphs |
FSE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper we present an efficient algorithm for the retrieval of the RC4 secret key, given an internal state. This algorithm is several orders of magnitude faster tha...
JCO
1998
13 years 7 months ago
1998
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
COMPSYSTECH
2011
12 years 7 months ago
2011
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
NJC
1998
13 years 7 months ago
1998
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
COCO
2004
Springer
14 years 28 days ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...