The multi-terminal vertex separator problem: total dual integrality and polytope composition

Y. Magnouche (), A. R. Mahjoub () and S. Martin ()
Additional contact information
Y. Magnouche: Huawei Technologies
A. R. Mahjoub: Kuwait University
S. Martin: Huawei Technologies

Journal of Combinatorial Optimization, 2025, vol. 50, issue 3, No 5, 42 pages

Abstract: Abstract Let $$G=(V\cup T,E)$$ be a graph where $$V\cup T$$ is the set of vertices, with T a subset of distinguished vertices, called terminals, and E the set of edges. Given a weight function $$w: V\rightarrow \mathbb N{\setminus } \{0\}$$ associated with the nonterminal nodes, the multi-terminal vertex separator problem consists in partitioning $$V\cup T$$ into $$k+1$$ subsets $$\{S, V_1,\dots , V_k\}$$ such that there is no edge between two different subsets $$V_i$$ and $$V_j$$ , each $$V_i$$ contains exactly one terminal and the weight of S is minimum. In this paper, we characterize the polytope of the solutions of this problem for two classes of the graph, and we show that the two linear systems are totally dual integral. Then, we study the polytope for the graphs that are decomposable by 1-node cutsets. We show that if G decomposes into $$G_1, \dots , G_k$$ , then the polytope in G can be obtained from those in $${\bar{G}}_1, \dots , {\bar{G}}_k$$ , where $${\bar{G}}_1, \dots , {\bar{G}}_k$$ are graphs related to $$G_1, \dots , G_k$$ , respectively. We also derive a procedure for composing facets and give some algorithmic consequences for solving the problem in G from $${\bar{G}}_1, \dots , {\bar{G}}_k$$ .

Keywords: Polytope; Vertex separator problem; Total dual integral; Facet; Node cutset (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01349-5 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:50:y:2025:i:3:d:10.1007_s10878-025-01349-5

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

DOI: 10.1007/s10878-025-01349-5

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 ().