Skip to main content
SpringerLink
Log in

Polynomial algorithms for kernels in comparability, permutation and P4-free graphs

  • Published:
4OR Aims and scope Submit manuscript

Abstract.

In this paper, we give three polynomial algorithms which detect a kernel in comparability graphs relatively to an M-orientation, in permutation graphs and in P4-free graphs with a normal orientation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. USTHB, Faculté de Mathématiques, LAID3, El-Alia, BP 32, Bab-Ezzouar, 16111, Alger, Algérie

    Moncef Abbas

  2. Département de Mathématiques, Ecole Normale Supérieure, BP 92 Kouba, 16050, Alger, Algérie

    Youcef Saoula

Authors
  1. Moncef Abbas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Youcef Saoula
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Youcef Saoula.

Additional information

MSC classification:

05C69, 05C85

Correspondence to: Saoula Youcef

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abbas, M., Saoula, Y. Polynomial algorithms for kernels in comparability, permutation and P4-free graphs. 4OR 3, 217–225 (2005). https://doi.org/10.1007/s10288-005-0067-9

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-005-0067-9

Keywords:

Search

Navigation