Sciweavers

990 search results - page 74 / 198
» Sub-Graphs of Complete Graph
Sort
View
EJC
2010
13 years 9 months ago
The flipping puzzle on a graph
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
Hau-wen Huang, Chih-wen Weng
ENTCS
2007
104views more  ENTCS 2007»
13 years 9 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
BMCBI
2008
116views more  BMCBI 2008»
13 years 9 months ago
A novel representation of RNA secondary structure based on element-contact graphs
Background: Depending on their specific structures, noncoding RNAs (ncRNAs) play important roles in many biological processes. Interest in developing new topological indices based...
Wenjie Shu, Xiaochen Bo, Zhiqiang Zheng, Shengqi W...
FOGA
2007
13 years 10 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
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
14 years 2 months ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
Jelle R. Kok, Nikos A. Vlassis