Sciweavers

14 search results - page 1 / 3
» jgaa 2007
Sort
View
JGAA
2007
66views more  JGAA 2007»
13 years 3 months ago
Estimating the Number of s-t Paths in a Graph
Ben Roberts, Dirk P. Kroese
JGAA
2007
52views more  JGAA 2007»
13 years 3 months ago
Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs
Athula Gunawardena, Robert R. Meyer
JGAA
2007
81views more  JGAA 2007»
13 years 3 months ago
The Traveling Salesman Problem for Cubic Graphs
We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3
David Eppstein
JGAA
2007
123views more  JGAA 2007»
13 years 3 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta