Tableau procedures for modal logics are often given as tree-based procedures. Naive implementations, however, are mostly not complexity-optimal since work might be repeated on different branches of the tree. One solution is to try to collapse the tree into a (full) graph which then allows a complexity-optimal implementations. This talk presents (initial) investigations on when a tree-based tableau procedure can automatically turned into a graph-based one without compromising soundness and correctness.