52 search results - page 11 / 11 » Minimum Connected Dominating Sets of Random Cubic Graphs |
ALGORITHMICA
2006
13 years 5 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
WEA
2010
Springer
13 years 11 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...