Abstract
Motivated by an approach to image segmentation, we consider an optimization problem on a node-weighted planar grid graph, that of finding a maximum weight subset of nodes that can be partitioned into m subsets, each with a simple geometric structure. The problem has been considered in earlier papers, which give polynomial time algorithms for m=2. We show that the problem admits a polynomial time algorithm for any fixed m≥3. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Gibson, M., Varadarajan, K., & Wu, X. (2014). Computing regions decomposable into m stars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8737 LNCS, pp. 480–491). Springer Verlag. https://doi.org/10.1007/978-3-662-44777-2_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
