Showing math.COShow all
2 papers · 1 filter
math.CO2011
Two-Color Babylon
Agelos Georgakopoulos, Peter Winkler
We solve the game of Babylon when played with chips of two colors, giving a winning strategy for the second player in all previously unsolved cases.
math.CO2011
New Bounds for Edge-Cover by Random Walk
Agelos Georgakopoulos, Peter Winkler
We show that the expected time for a random walk on a (multi-)graph to traverse all edges of , and return to its starting point, is at most ; if each edge must be…