default search action
"A branch-and-cut algorithm for the k-edge connected subgraph problem."
Fatiha Bendali et al. (2010)
- Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert:
A branch-and-cut algorithm for the k-edge connected subgraph problem. Networks 55(1): 13-32 (2010)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.