Sciweavers

8 search results - page 1 / 2
» colognetwente 2010
Sort
View
92
Voted
COLOGNETWENTE
2010
14 years 11 months ago
Lattices and Maximum Flow Algorithms in Planar Graphs
Jannik Matuschke
99
Voted
COLOGNETWENTE
2010
14 years 11 months ago
Static Symmetry Breaking in Circle Packing
Alberto Costa, Pierre Hansen, Leo Liberti
105
Voted
COLOGNETWENTE
2010
14 years 11 months ago
On the Convergence of Feasibility based Bounds Tightening
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
131
Voted
COLOGNETWENTE
2010
14 years 11 months ago
Approximating Independent Set in Semi-Random Graphs
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
Bodo Manthey, Kai Plociennik
164
Voted
COLOGNETWENTE
2010
14 years 11 months ago
Bisimplicial Edges in Bipartite Graphs
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
Matthijs Bomhoff, Bodo Manthey