We give a complete description of the k-edge connected spanning subgraph polytope (for all k) on series-parallel graphs.
Apr 21, 2020 · The k-edge-connected spanning subgraph polyhedron of G, hereafter denoted by Pk(G), is the convex hull of all the k-edge-connected spanning ...
Jul 22, 2020 · We prove that this polyhedron is box-totally dual integral if and only if G is series-parallel. In this case, we also provide an integer box-totally dual ...
May 4, 2020 · We prove that this polyhedron is box-totally dual integral if and only if G is series-parallel. In this case, we also provide an integer box-totally dual ...
On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel ...
www.researchgate.net › ... › Graphs
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only ...
We prove that this polyhedron is box-totally dual integral if and only if G is series-parallel. In this case, we also provide an integer box-totally dual ...
Oct 18, 2024 · On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs · Fonction : Auteur · PersonId : 775335 · ORCID : 0000-0002-7093-2175.
The convex hull of the k-edge-connected spanning subgraphs of a graph G forms the k-edge-connected spanning subgraph polyhedron of G. We prove that this ...
We also prove that, when k is odd, the k-edge-connected spanning subgraph polyhedron is a box-TDI polyhedron. Definitions. Throughout the paper, G = (V,E) ...
Abstract. In this paper we consider the Steiner k-edge survivable network problem. We discuss the polytope associated with the solutions to that problem. We ...
Missing: Box- TDIness