2487 search results - page 22 / 498 » Partitions of Graphs into Trees |
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems ob...
110
Voted
EOR
2010
15 years 1 months ago
2010
The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbor...
133
Voted
DAM
2011
14 years 8 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
75
Voted
RSA
2006
15 years 1 months ago
2006
135
click to vote
ICDE
2007
IEEE
15 years 5 months ago
2007
IEEE
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...