On the linear relaxation of the 2-node connected subgraph polytope

DOI10.1016/S0166-218X(99)00088-8zbMath0932.05087OpenAlexW1990666137WikidataQ127344149 ScholiaQ127344149MaRDI QIDQ1302172

C. Nocq, Ali Ridha Mahjoub

Publication date: 22 September 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00088-8

zbMATH Keywords

extreme pointpolytope2-node connected subgraph polytope

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (1)

The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut

This page was built for publication: On the linear relaxation of the 2-node connected subgraph polytope