Construction of simple path graphs in transport networks: II. Analysis of graphs' biconnectivity
The problem of constructing all simple paths in an undirected graph that pairwise connect vertices from the given set is interpreted as constructing a graph that is a union of these paths. This construction relies on the computation of biconnected components and bridges of the source graph. A new al...
में बचाया:
| मुख्य लेखकों: | , |
|---|---|
| स्वरूप: | Статья |
| भाषा: | English |
| प्रकाशित: |
PLEIADES PUBLISHING INC
2021
|
| विषय: | |
| ऑनलाइन पहुंच: | https://dspace.ncfu.ru/handle/20.500.12258/18461 |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|
| id |
ir-20.500.12258-18461 |
|---|---|
| record_format |
dspace |
| spelling |
ir-20.500.12258-184612022-01-18T09:37:02Z Construction of simple path graphs in transport networks: II. Analysis of graphs' biconnectivity Golovinskii, I. A. Головинский, И. А. Transport networks Analysis of graphs' biconnectivity Hopcroft-Tarjan algorithm Simple paths The problem of constructing all simple paths in an undirected graph that pairwise connect vertices from the given set is interpreted as constructing a graph that is a union of these paths. This construction relies on the computation of biconnected components and bridges of the source graph. A new algorithm which makes this computation more transparent and controllable is proposed. Its idea is to track opening and closing of chords at the depth-first search. Due to the clarity of the proposed solution, its correctness is obvious without much justification. This is its advantage over the well-known Hopcroft-Tarjan algorithm. The proposed algorithm makes self-evident the obtaining biconnected components of a graph by successive uniting its fundamental cycles that have common edges. 2021-12-01T10:03:00Z 2021-12-01T10:03:00Z 2021 Статья Golovinskii, I. A. Construction of simple path graphs in transport networks: II. Analysis of graphs' biconnectivity // Journal of Computer and Systems Sciences International. - 2021. - Том 60. - Выпуск 2. - Стр.: 213-226. - DOI10.1134/S1064230721020040 http://hdl.handle.net/20.500.12258/18461 en Journal of Computer and Systems Sciences International application/pdf PLEIADES PUBLISHING INC |
| institution |
СКФУ |
| collection |
Репозиторий |
| language |
English |
| topic |
Transport networks Analysis of graphs' biconnectivity Hopcroft-Tarjan algorithm Simple paths |
| spellingShingle |
Transport networks Analysis of graphs' biconnectivity Hopcroft-Tarjan algorithm Simple paths Golovinskii, I. A. Головинский, И. А. Construction of simple path graphs in transport networks: II. Analysis of graphs' biconnectivity |
| description |
The problem of constructing all simple paths in an undirected graph that pairwise connect vertices from the given set is interpreted as constructing a graph that is a union of these paths. This construction relies on the computation of biconnected components and bridges of the source graph. A new algorithm which makes this computation more transparent and controllable is proposed. Its idea is to track opening and closing of chords at the depth-first search. Due to the clarity of the proposed solution, its correctness is obvious without much justification. This is its advantage over the well-known Hopcroft-Tarjan algorithm. The proposed algorithm makes self-evident the obtaining biconnected components of a graph by successive uniting its fundamental cycles that have common edges. |
| format |
Статья |
| author |
Golovinskii, I. A. Головинский, И. А. |
| author_facet |
Golovinskii, I. A. Головинский, И. А. |
| author_sort |
Golovinskii, I. A. |
| title |
Construction of simple path graphs in transport networks: II. Analysis of graphs' biconnectivity |
| title_short |
Construction of simple path graphs in transport networks: II. Analysis of graphs' biconnectivity |
| title_full |
Construction of simple path graphs in transport networks: II. Analysis of graphs' biconnectivity |
| title_fullStr |
Construction of simple path graphs in transport networks: II. Analysis of graphs' biconnectivity |
| title_full_unstemmed |
Construction of simple path graphs in transport networks: II. Analysis of graphs' biconnectivity |
| title_sort |
construction of simple path graphs in transport networks: ii. analysis of graphs' biconnectivity |
| publisher |
PLEIADES PUBLISHING INC |
| publishDate |
2021 |
| url |
https://dspace.ncfu.ru/handle/20.500.12258/18461 |
| work_keys_str_mv |
AT golovinskiiia constructionofsimplepathgraphsintransportnetworksiianalysisofgraphsbiconnectivity AT golovinskijia constructionofsimplepathgraphsintransportnetworksiianalysisofgraphsbiconnectivity |
| _version_ |
1760601294090797056 |