On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model

Matthias Bentert, Jannik Schestag, Frank Sommer

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

10 Downloads (Pure)

Fingerprint

Dive into the research topics of 'On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model'. Together they form a unique fingerprint.

Computer Science

INIS