3265 search results - page 124 / 653 » Representing Groups on Graphs |
159
click to vote
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
126
click to vote
MICS
2010
14 years 10 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
148
Voted
AAIM
2009
Springer
15 years 10 months ago
2009
Springer
During the last years, a wide range of huge networks has been made available to researchers. The discovery of natural groups, a task called graph clustering, in such datasets is a ...
134
click to vote
ROBOCUP
2005
Springer
15 years 9 months ago
2005
Springer
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...
112
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...