A general framework for path convexities

João Vinicius C. Thompson (), Loana T. Nogueira (), Fábio Protti (), Raquel S. F. Bravo (), Mitre C. Dourado () and Uéverton S. Souza ()
Additional contact information
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

Journal of Combinatorial Optimization, 2022, vol. 43, issue 5, No 5, 994-1009

Abstract: 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.

Keywords: Algorithmic complexity; Graph convexity; Path convexity (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00618-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:43:y:2022:i:5:d:10.1007_s10878-020-00618-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00618-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().