A polynomial-time algorithm for spanning tree modulus
From MaRDI portal
Publication:6348677
arXiv2009.03736MaRDI QIDQ6348677FDOQ6348677
Authors: Nathan Albin, Pietro Poggi-Corradini 
Publication date: 8 September 2020
Abstract: We introduce a polynomial-time algorithm for spanning tree modulus based on Cunningham's algorithm for graph vulnerability. The algorithm exploits an interesting connection between spanning tree modulus and critical edge sets from the vulnerability problem. This paper describes the new algorithm, describes a practical means for implementing it using integer arithmetic, and presents some examples and computational time scaling tests.
This page was built for publication: A polynomial-time algorithm for spanning tree modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348677)
