Half-space separation in monophonic convexity - Aix-Marseille Université Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Half-space separation in monophonic convexity

Résumé

We study half-space separation in the convexity of chordless paths of a graph, i.e., monophonic convexity. In this problem, one is given a graph and two (disjoint) subsets of vertices and asks whether these two sets can be separated by complementary convex sets, called half-spaces. While it is known this problem is NP-complete for geodesic convexity -- the convexity of shortest paths -- we show that it can be solved in polynomial time for monophonic convexity.

Dates et versions

hal-04683675 , version 1 (02-09-2024)

Identifiants

Citer

Mohammed Elaroussi, Lhouari Nourine, Simon Vilmin. Half-space separation in monophonic convexity. Mathematical Foundation of Computer Science (MFCS), Aug 2024, Bratislava, Slovakia. ⟨10.4230/LIPIcs.MFCS.2024.51⟩. ⟨hal-04683675⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More