3265 search results - page 48 / 653 » Representing Groups on Graphs |
126
click to vote
IFL
1997
Springer
15 years 7 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
145
Voted
DAM
2008
15 years 3 months ago
2008
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
121
click to vote
DM
2008
15 years 3 months ago
2008
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primitively on the set of vertices. If F consists of Hamiltonian cycles, then F is the...
140
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
117
Voted
FOGA
2007
15 years 5 months ago
2007
In the case where the search space has a group structure, classical genetic operators (mutation and two-parent crossover) which respect the group action are completely characterize...