Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Complexity of Finding a Sparse Connected Spanning Subgraph in a ..."

Matthias Bentert, Jannik Schestag, Frank Sommer (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.IPEC.2023.4

access: open

type: Conference or Workshop Paper

metadata version: 2023-12-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/iwpec/BentertSS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwpec/BentertSS23
Matthias Bentert, Jannik Schestag, Frank Sommer:
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. IPEC 2023: 4:1-4:12

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.