8 citations · 31 across the 33 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013
Algorithmic and Hardness Results for the Colorful Components Problems
Anna Adamaszek, Alexandru Popa
In this paper we investigate the colorful components framework, motivated by applications emerging from comparative genomics. The general goal is to remove a collection of edges fr…
cs.DS2013
The min-max edge q-coloring problem
Tommi Larjomaa, Alexandru Popa
In this paper we introduce and study a new problem named \emph{min-max edge -coloring} which is motivated by applications in wireless mesh networks. The input of the problem con…