983 search results - page 49 / 197 » Negative-Weight Cycle Algorithms |
106
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
This paper presents two methods for improving the performance of the Distributed Breakout Algorithm using the notion of interchangeability. In particular, we use neighborhood part...
114
Voted
CSR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We show that partial 2-tree canonization, and hence isomorphism testing for partial 2-trees, is in deterministic logspace. Our algorithm involves two steps: (a) We exploi...
CG
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
99
Voted
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
122
click to vote
CCCG
2010
15 years 4 months ago
2010
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...