An exact-arithmetic algorithm for spanning tree modulus
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913444018520064 |
|---|---|
| author | Albin, Nathan Kottegoda, Kapila Poggi-Corradini, Pietro |
| author_facet | Albin, Nathan Kottegoda, Kapila Poggi-Corradini, Pietro |
| contents | Spanning tree modulus is a generalization of effective resistance that is closely related to graph strength and fractional arboricity. The optimal edge density associated with spanning tree modulus is known to produce two hierarchical decompositions of arbitrary graphs, one based on strength and the other on arboricity. Here we introduce an exact-arithmetic algorithm for spanning tree modulus and the strength-based decomposition using 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 introduces the new algorithm, describes a practical means for implementing it using integer arithmetic, and presents some examples and computational time scaling tests. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2009_03736 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | An exact-arithmetic algorithm for spanning tree modulus Albin, Nathan Kottegoda, Kapila Poggi-Corradini, Pietro Combinatorics Spanning tree modulus is a generalization of effective resistance that is closely related to graph strength and fractional arboricity. The optimal edge density associated with spanning tree modulus is known to produce two hierarchical decompositions of arbitrary graphs, one based on strength and the other on arboricity. Here we introduce an exact-arithmetic algorithm for spanning tree modulus and the strength-based decomposition using 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 introduces the new algorithm, describes a practical means for implementing it using integer arithmetic, and presents some examples and computational time scaling tests. |
| title | An exact-arithmetic algorithm for spanning tree modulus |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2009.03736 |