"A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph ..."

Hiroshi Nagamochi, Toshihide Ibaraki (1992)

> Home

Details and statistics

DOI: 10.1007/BF01758778

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/NagamochiI92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/NagamochiI92
Hiroshi Nagamochi, Toshihide Ibaraki:
A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. Algorithmica 7(5&6): 583-596 (1992)

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.