IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v43y2022i5d10.1007_s10878-020-00618-9.html
   My bibliography  Save this article

A general framework for path convexities

Author

Listed:
  • João Vinicius C. Thompson

    (CEFET/Petrópolis)

  • Loana T. Nogueira

    (Universidade Federal Fluminense)

  • Fábio Protti

    (Universidade Federal Fluminense)

  • Raquel S. F. Bravo

    (Universidade Federal Fluminense)

  • Mitre C. Dourado

    (Universidade Federal do Rio de Janeiro)

  • Uéverton S. Souza

    (Universidade Federal Fluminense)

Abstract

In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of the induced paths is associated with the monophonic convexity; and there are many other examples. Besides reviewing the path convexities in the literature, we propose a general path convexity framework, of which most existing path convexities can be viewed as particular cases. Some benefits of the proposed framework are the systematization of the algorithmic study of related problems and the possibility of defining new convexities not yet investigated.

Suggested Citation

  • João Vinicius C. Thompson & Loana T. Nogueira & Fábio Protti & Raquel S. F. Bravo & Mitre C. Dourado & Uéverton S. Souza, 2022. "A general framework for path convexities," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 994-1009, July.
    • Handle: RePEc:spr:jcomop:v:43:y:2022:i:5:d:10.1007_s10878-020-00618-9
    DOI: 10.1007/s10878-020-00618-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00618-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-020-00618-9?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.

    References listed on IDEAS

    as
    1. Carlos V. G. C. Lima & Fábio Protti & Dieter Rautenbach & Uéverton S. Souza & Jayme L. Szwarcfiter, 2018. "And/or-convexity: a graph convexity based on processes and deadlock models," Annals of Operations Research, Springer, vol. 264(1), pages 267-286, May.
    2. Marcio Antônio Duarte & Lucia Penso & Dieter Rautenbach & Uéverton Santos Souza, 2017. "Complexity properties of complementary prisms," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 365-372, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Neumann, Peter & Pastowski, Sven & Carpinelli, Sonia, 2024. "Bleisure Travel: Potenziale und Handlungsempfehlungen für die Tourismuspraxis," IU Discussion Papers - Hospitality, Tourism & Event 2 (August 2024), IU International University of Applied Sciences.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. João Vinicius C. Thompson & Loana T. Nogueira & Fábio Protti & Raquel S. F. Bravo & Mitre C. Dourado & Uéverton S. Souza, 0. "A general framework for path convexities," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-16.

    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:spr:jcomop:v:43:y:2022:i:5:d:10.1007_s10878-020-00618-9. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.