Saved in:
Bibliographic Details
Main Authors: Bentert, Matthias, Drange, Pål Grønås, Fomin, Fedor V., Simonnes, Steinar
Format: Recurso digital
Language:
Published: Zenodo 2025
Online Access:https://doi.org/10.5281/zenodo.15387002
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of 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>