220 search results - page 3 / 44 » Reconstruction Algorithm for Permutation Graphs |
AAECC
2007
Springer
14 years 1 months ago
2007
Springer
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C′ whose minimal trellis has the least state-compl...
IPL
2000
13 years 7 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...