A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
Crossref DOI link: https://doi.org/10.1007/s11590-018-1371-6
Published Online: 2018-12-14
Published Print: 2019-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Lalou, Mohammed http://orcid.org/0000-0002-8837-4351
Kheddouci, Hamamache
Text and Data Mining valid from 2018-12-14
Article History
Received: 4 April 2018
Accepted: 6 December 2018
First Online: 14 December 2018