2322 search results - page 187 / 465 » On a game in directed graphs |
193
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
181
click to vote
DAC
1998
ACM
15 years 11 months ago
1998
ACM
This paper considers the rate optimal VLSI design of a recursive data flow graph (DFG). Previous research on rate optimal scheduling is not directly applicable to VLSI design. We ...
182
click to vote
IPL
2010
15 years 5 months ago
2010
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
174
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
181
click to vote
GECCO
2004
Springer
16 years 19 hour ago
2004
Springer
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...