45 search results - page 7 / 9 » A Fast Algorithm for Enumerating Bipartite Perfect Matchings |
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
107
click to vote
CPHYSICS
2011
14 years 1 months ago
2011
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
115
click to vote
ICYCS
2008
IEEE
15 years 3 months ago
2008
IEEE
— Nowadays wireless mesh routers are facilitating with more wireless channels than ever because of the advanced wireless communication technologies such as OFDM, SDR and CR(cogni...
89
Voted
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...