A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints
Crossref DOI link: https://doi.org/10.1007/s00453-019-00554-z
Published Online: 2019-03-02
Published Print: 2019-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Subramani, K. http://orcid.org/0000-0001-5821-5117
Wojciechowki, Piotr http://orcid.org/0000-0003-1684-1077
Text and Data Mining valid from 2019-03-02
Article History
Received: 15 January 2018
Accepted: 21 February 2019
First Online: 2 March 2019