Unlike MPP, the MCP can be calculated efficiently using dynamic programming techniques over the parse forest.
extracting this particular set of fragments is not trivial, though: a naive approach that filters a complete table of fragments together with their frequencies fails because that set, in a reasonably sized treebank, is astronomically large.