402 search results - page 71 / 81 » On Finding the Number of Graph Automorphisms |
EPS
1998
Springer
13 years 12 months ago
1998
Springer
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
ICSM
2006
IEEE
14 years 1 months ago
2006
IEEE
Software Engineers frequently need to locate and understand the code that implements a specific user feature of a large system. This paper reports on a study by Motorola Inc. and ...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
BMCBI
2010
13 years 7 months ago
2010
Background: Biological networks offer us a new way to investigate the interactions among different components and address the biological system as a whole. In this paper, a revers...