An exact-arithmetic algorithm for spanning tree modulus

DOI10.1002/NET.22270MaRDI QIDQ6971584zbMATH OpenFDO

Authors Nathan Albin, Pietro Poggi-Corradini

Publication date 13 June 2025

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.22270

zbMATH Keywords

discrete modulusgraph vulnerabilityspanning trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Cites work

• Blocking duality for \(p\)-modulus on networks and applications
• Design of network topology in an adversarial environment
• Fairest edge usage and minimum expected overlap for random spanning trees
• Minimal subfamilies and the probabilistic interpretation for modulus on graphs
• Modulus for bases of matroids
• Modulus of families of walks on graphs
• Optimal attack and reinforcement of a network
• Spanning tree modulus for secure broadcast games
• Spanning Trees and Optimization Problems

This page was built for publication: An exact-arithmetic algorithm for spanning tree modulus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971584)