default search action

combined dblp search
author search
venue search
publication search

ask others

"On the hardness of constructing minimal 2-connected spanning subgraphs in ..."

Hans-Joachim Böckenhauer et al. (2004)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2004.06.019

access: open

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/BockenhauerBHKPSU04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BockenhauerBHKPSU04
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. 326(1-3): 137-153 (2004)

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.