A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs

From MaRDI portal
Publication:2329655

DOI10.1007/s11590-018-1371-6zbMath1429.90062OpenAlexW2905339563WikidataQ128758713 ScholiaQ128758713MaRDI QIDQ2329655

Hamamache Kheddouci, Mohammed Lalou

Publication date: 18 October 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1371-6




Related Items (5)



Cites Work


This page was built for publication: A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs