22 search results - page 5 / 5 » Improved Inapproximability Results for Maximum k-Colorable S... |
CPM
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
FOCS
2008
IEEE
14 years 8 days ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...