| _version_ | 1866902145184301056 |
|---|---|
| author | Bentert, Matthias Drange, Pål Grønås Fomin, Fedor V. Simonnes, Steinar |
| author_facet | Bentert, Matthias Drange, Pål Grønås Fomin, Fedor V. Simonnes, Steinar |
| contents | <p>Network Diversion is a graph problem that has been extensively studied in both the network-analysis and operations-research communities as a measure of how robust a network is against adversarial disruption. In Network Diversion we want to enforce all s-t-paths through a specific edge b by removing edges from G.</p> <p>This package is the supplementary code for the paper Planar Network Diversion presented at SEA 2025.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_15387002 |
| institution | Zenodo |
| language | |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Planar Network Diversion Source Code Bentert, Matthias Drange, Pål Grønås Fomin, Fedor V. Simonnes, Steinar <p>Network Diversion is a graph problem that has been extensively studied in both the network-analysis and operations-research communities as a measure of how robust a network is against adversarial disruption. In Network Diversion we want to enforce all s-t-paths through a specific edge b by removing edges from G.</p> <p>This package is the supplementary code for the paper Planar Network Diversion presented at SEA 2025.</p> |
| title | Planar Network Diversion Source Code |
| url | https://doi.org/10.5281/zenodo.15387002 |