NP-Completeness of the Independent Dominating Set Problem in the Class of Cubic Planar Bipartite Graphs
Crossref DOI link: https://doi.org/10.1134/S1990478920020131
Published Online: 2020-07-10
Published Print: 2020-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Loverov, Ya. A.
Orlovich, Yu. L.
Text and Data Mining valid from 2020-05-01
Version of Record valid from 2020-05-01
Article History
Received: 11 April 2019
Revised: 20 December 2019
Accepted: 13 January 2020
First Online: 10 July 2020