"On the Complexity of Computing the k-restricted Edge-connectivity of a Graph."

Luis Pedro Montejano, Ignasi Sau (2015)

> Home

Details and statistics

DOI: 10.1007/978-3-662-53174-7_16

access: closed

type: Conference or Workshop Paper

metadata version: 2022-07-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/MontejanoS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/MontejanoS15
Luis Pedro Montejano, Ignasi Sau:
On the Complexity of Computing the k-restricted Edge-connectivity of a Graph. WG 2015: 219-233

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.