Digraphs of potential barriers: properties of their tree structure and algorithm for constructing minimum spanning forests
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908328414674944 |
|---|---|
| author | Buslov, Vasily |
| author_facet | Buslov, Vasily |
| contents | For a weighted digraph without loops $V$, the arc weights of which can be obtained from an undirected graph with loops ${\sf P}$ according to the rule $v_{ij}=p_{ij}-p_{ii}$, the properties are studied. An effective algorithm for constructing directed trees of minimum weight and an algorithm for constructing spanning directed forests of minimum weight are proposed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_14484 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Digraphs of potential barriers: properties of their tree structure and algorithm for constructing minimum spanning forests Buslov, Vasily Combinatorics 05C20 (Primary) 05C35 (Secondary) G.2.2 For a weighted digraph without loops $V$, the arc weights of which can be obtained from an undirected graph with loops ${\sf P}$ according to the rule $v_{ij}=p_{ij}-p_{ii}$, the properties are studied. An effective algorithm for constructing directed trees of minimum weight and an algorithm for constructing spanning directed forests of minimum weight are proposed. |
| title | Digraphs of potential barriers: properties of their tree structure and algorithm for constructing minimum spanning forests |
| topic | Combinatorics 05C20 (Primary) 05C35 (Secondary) G.2.2 |
| url | https://arxiv.org/abs/2504.14484 |