1097 search results - page 90 / 220 » Testing Graph Isomorphism |
ICSE
2008
IEEE-ACM
15 years 10 months ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
GECCO
2006
Springer
15 years 1 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...
CORR
2010
Springer
14 years 5 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
EVOW
2006
Springer
15 years 1 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
IWANN
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we present the integration of graph-based visual perception to spoken conversation in human-robot interaction. The proposed architecture has a dialogue manager as the...