1447 search results - page 106 / 290 » Graphs and Path Equilibria |
145
click to vote
COLOGNETWENTE
2009
15 years 5 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
133
click to vote
TOG
2002
15 years 3 months ago
2002
In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a mo...
125
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
123
click to vote
JCT
2008
15 years 4 months ago
2008
A graph G is k-linked if G has at least 2k vertices, and for every sequence x1, x2, . . . , xk, y1, y2, . . . , yk of distinct vertices, G contains k vertex-disjoint paths P1, P2,...
156
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
This study proposes a simple computational model of evolutionary learning in organizations informed by genetic algorithms. Agents who interact only with neighboring partners seek ...