5473 search results - page 93 / 1095 » On the graph isomorphism problem |
171
click to vote
COR
2007
15 years 6 months ago
2007
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
200
click to vote
TCS
2010
15 years 5 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
209
click to vote
GECCO
2003
Springer
16 years 1 days ago
2003
Springer
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
181
click to vote
EVOW
2004
Springer
16 years 6 days ago
2004
Springer
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
209
click to vote
MST
2006
15 years 6 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...