Skip to Main content Skip to Navigation
Journal articles

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

Mohammed Lalou 1 Hamamache Kheddouci 1
1 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02020187
Contributor : Hamamache Kheddouci <>
Submitted on : Friday, February 15, 2019 - 9:52:29 AM
Last modification on : Monday, December 30, 2019 - 8:35:19 AM

Identifiers

  • HAL Id : hal-02020187, version 1

Citation

Mohammed Lalou, Hamamache Kheddouci. A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs. Optimization Letters, Springer Verlag, In press. ⟨hal-02020187⟩

Share

Metrics

Record views

80