We generalize the result of Bernhard, Hedetniemi and Jacobs by providing a linear time algorithm that computes the efficiency number of a partial k-tree (given with its embedding in a k-tree).