9 search results - page 1 / 2 » Finding Cycles and Trees in Sublinear Time |
CORR
2010
Springer
12 years 11 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
SIGECOM
2006
ACM
13 years 10 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
RECOMB
2006
Springer
14 years 5 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
JACM
2007
13 years 4 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
DAM
2010
13 years 4 months ago
2010
We consider the process of cleaning a network where at each time step, all vertices that have at least as many brushes as incident, contaminated edges, send brushes down these edg...