APA (7th ed.) Citation

Reinelt, G., Theis, D., & Wenger, K. (2008). Computing finest mincut partitions of a graph and application to routing problems. Discrete applied mathematics, 156(3), . https://doi.org/10.1016/j.dam.2007.03.022

Chicago Style (17th ed.) Citation

Reinelt, Gerhard, Dirk Theis, and Klaus Wenger. "Computing Finest Mincut Partitions of a Graph and Application to Routing Problems." Discrete Applied Mathematics 156, no. 3 (2008). https://doi.org/10.1016/j.dam.2007.03.022.

MLA (9th ed.) Citation

Reinelt, Gerhard, et al. "Computing Finest Mincut Partitions of a Graph and Application to Routing Problems." Discrete Applied Mathematics, vol. 156, no. 3, 2008, https://doi.org/10.1016/j.dam.2007.03.022.