Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An Approximation for Finding a Smallest 2-Edge-Connected Subgraph ..."

Hiroshi Nagamochi, Toshihide Ibaraki (1999)

> Home

Details and statistics

DOI: 10.1007/3-540-48686-0_3

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/NagamochiI99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/NagamochiI99
Hiroshi Nagamochi, Toshihide Ibaraki:
An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. COCOON 1999: 31-40

a service of

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.