APA (7th ed.) Citation

Backer, J., & Keil, J. M. (2010). Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs. Information processing letters, 110(16), 635-638. https://doi.org/10.1016/j.ipl.2010.05.011

Chicago Style (17th ed.) Citation

Backer, Jonathan, and J. Mark Keil. "Constant Factor Approximation Algorithms for the Densest K-subgraph Problem on Proper Interval Graphs and Bipartite Permutation Graphs." Information Processing Letters 110, no. 16 (2010): 635-638. https://doi.org/10.1016/j.ipl.2010.05.011.

MLA (9th ed.) Citation

Backer, Jonathan, and J. Mark Keil. "Constant Factor Approximation Algorithms for the Densest K-subgraph Problem on Proper Interval Graphs and Bipartite Permutation Graphs." Information Processing Letters, vol. 110, no. 16, 2010, pp. 635-638, https://doi.org/10.1016/j.ipl.2010.05.011.