6740 search results - page 145 / 1348 » An s -Hamiltonian Line Graph Problem |
CC
2006
Springer
13 years 10 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...
SLS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
CATS
2006
13 years 11 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
ENDM
2008
13 years 10 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
ANTSW
2010
Springer
13 years 8 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...