Document is current

Any future updates will be listed below

Computational Complexity of the Vertex Cover Problem in the Class of Planar Triangulations

Crossref DOI link: https://doi.org/10.1134/S0081543817090139

Published Online: 2018-02-08

Published Print: 2017-12

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark