IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v487y2025ics0096300324005459.html
   My bibliography  Save this article

The iteration time and the general position number in graph convexities

Author

Listed:
  • Araujo, Julio
  • Dourado, Mitre C.
  • Protti, Fábio
  • Sampaio, Rudini

Abstract

In this paper, we study two graph convexity parameters: iteration time and general position number. The iteration time was defined in 1981 in the geodesic convexity, but its computational complexity was so far open. The general position number was defined in the geodesic convexity and proved NP-hard in 2018. We extend these parameters to any graph convexity and prove that the iteration number is NP-hard in the P3 convexity. We use this result to prove that the iteration time is also NP-hard in the geodesic convexity even in graphs with diameter two, a long standing open question. These results are also important since they are the last two missing NP-hardness results regarding the ten most studied graph convexity parameters in the geodesic and P3 convexities. We also prove that the general position number of the monophonic convexity is W[1]-hard (parameterized by the size of the solution) and n1−ε-inapproximable in polynomial time for any ε>0 unless P=NP, even in graphs with diameter two. Finally, we also obtain FPT results on the general position number in the P3 convexity and we prove that it is W[1]-hard (parameterized by the size of the solution).

Suggested Citation

  • Araujo, Julio & Dourado, Mitre C. & Protti, Fábio & Sampaio, Rudini, 2025. "The iteration time and the general position number in graph convexities," Applied Mathematics and Computation, Elsevier, vol. 487(C).
    • Handle: RePEc:eee:apmaco:v:487:y:2025:i:c:s0096300324005459
    DOI: 10.1016/j.amc.2024.129084
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324005459
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.129084?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:487:y:2025:i:c:s0096300324005459. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.