Clausen, J., Sterbini, A., & Träff, J. L. (1996). An easily computable lower bound for the graph partitioning problem. DIKU.
Chicago Style (17th ed.) CitationClausen, Jens, Andrea Sterbini, and Jesper Larsson Träff. An Easily Computable Lower Bound for the Graph Partitioning Problem. København: DIKU, 1996.
MLA (9th ed.) CitationClausen, Jens, et al. An Easily Computable Lower Bound for the Graph Partitioning Problem. DIKU, 1996.
Warning: These citations may not always be 100% accurate.