21 search results - page 1 / 5» Permutation Reconstruction from Minors |

COMBINATORICS

2006

13 years 5 months ago
2006

We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible w...

ISAAC

2010

Springer

13 years 3 months ago
2010

Springer

A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...

DAGSTUHL

2006

13 years 6 months ago
2006

In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...

FSE

2008

Springer

13 years 6 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...

DCC

2006

IEEE

14 years 4 months ago
2006

IEEE

An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...