"A polynomial-time algorithm for finding critical nodes in bipartite ..."

Mohammed Lalou, Hamamache Kheddouci (2019)

> Home

Details and statistics

DOI: 10.1007/S11590-018-1371-6

access: closed

type: Journal Article

metadata version: 2020-07-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ol/LalouK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/LalouK19
Mohammed Lalou, Hamamache Kheddouci:
A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs. Optim. Lett. 13(6): 1345-1364 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.