Search Sciweavers | Sciweavers

We experimentally compare the two algorithms A and B by Fredman and Khachiyan [FK96] for the problem Monet--given two monotone Boolean formulas in DNF and in CNF, decide whether ...

Matthias Hagen, Peter Horatschek, Martin Mundhenk

claim paper

Read More »

11

click to vote

ALENEX
2009

118views Algorithms» more ALENEX 2009»

Solving Maximum Flow Problems on Real World Bipartite Graphs

13 years 5 months ago

Download static.googleusercontent.com

In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...

Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, B...

claim paper

Read More »

15

click to vote

ALENEX
2009

106views Algorithms» more ALENEX 2009»

Drawing Binary Tanglegrams: An Experimental Evaluation

13 years 5 months ago

Download www.win.tue.nl

A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...

Martin Nöllenburg, Markus Völker, Alexan...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers