29908 search results - page 248 / 5982 » On the Complexity of |
166
click to vote
EOR
2008
15 years 6 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
156
click to vote
FUIN
2008
15 years 6 months ago
2008
: We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate t...
149
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
196
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
164
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the tile self-assembly model and how tile complexity can be eliminated by permitting the temperature of the self-assembly system to be adjusted throughout the assembly...