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 (2003)

> Home

Details and statistics

DOI: 10.1016/S0166-218X(02)00218-4

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/Nagamochi03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Nagamochi03
Hiroshi Nagamochi:
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. Discret. Appl. Math. 126(1): 83-113 (2003)

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.