A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints.

MLA

Subramani, K., and Piotr Wojciechowki. “A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints.” Algorithmica, vol. 81, no. 7, July 2019, pp. 2765–94. EBSCOhost, https://doi.org/10.1007/s00453-019-00554-z.

APA

Subramani, K., & Wojciechowki, P. (2019). A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints. Algorithmica, 81(7), 2765–2794. https://doi.org/10.1007/s00453-019-00554-z

Chicago

Subramani, K., and Piotr Wojciechowki. 2019. “A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints.” Algorithmica 81 (7): 2765–94. doi:10.1007/s00453-019-00554-z.