"Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning ..."

Alexey Baburin, Edward Gimadi (2006)

> Home

Details and statistics

DOI: 10.1007/978-3-540-69995-8_36

access: closed

type: Conference or Workshop Paper

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/or/BaburinG06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/or/BaburinG06
Alexey Baburin, Edward Gimadi:
Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight. OR 2006: 215-220

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.