220 search results - page 6 / 44 » Reconstruction Algorithm for Permutation Graphs |
101
Voted
WAW
2009
Springer
15 years 6 months ago
2009
Springer
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
115
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
136
click to vote
COCOON
2010
Springer
14 years 11 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
SODA
1997
ACM
15 years 1 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
124
Voted
CPM
2006
Springer
15 years 4 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...