  We give a lower bound for the Castelnuovo-Mumford regularity of binomial edge
ideals of block graphs by computing the two distinguished extremal Betti
numbers of a new family of block graphs, called flower graphs. Moreover, we
present a linear time algorithm to compute the Castelnuovo-Mumford regularity
and Krull dimension of binomial edge ideals of block graphs.
