Sciweavers

3265 search results - page 48 / 653
» Representing Groups on Graphs
Sort
View
153
Voted
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 9 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
171
Voted
DAM
2008
109views more  DAM 2008»
15 years 5 months ago
Minimal comparability completions of arbitrary graphs
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...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
DM
2008
89views more  DM 2008»
15 years 5 months ago
Primitive 2-factorizations of the complete graph
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...
Giuseppe Mazzuoccolo
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Canonical Data Structure for Interval Probe Graphs
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...
Ryuhei Uehara
140
Voted
FOGA
2007
15 years 7 months ago
Neighborhood Graphs and Symmetric Genetic Operators
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...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright