Construction of simple path graphs in transport networks: I. general solutions and examples

The calculation of the set of all simple paths connecting two vertices of an undirected graph is considered. The more general problems of connecting vertices which belong to disjoint sets of vertices in a graph by all simple paths are also investigated. The connection between these problems and find...

Ful tanımlama

Kaydedildi:

Detaylı Bibliyografya
Asıl Yazarlar:	Golovinskii, I. A., Головинский, И. А.
Materyal Türü:	Статья
Dil:	English
Baskı/Yayın Bilgisi:	Pleiades journals 2021
Konular:	Biconnected components Undirected graph Transport networks Real-time management Path graphs General solutions Disjoint sets Complete solutions Graph theory
Online Erişim:	https://dspace.ncfu.ru/handle/20.500.12258/15449
Etiketler:	Etiketle Etiket eklenmemiş, İlk siz ekleyin!

id	ir-20.500.12258-15449
record_format	dspace
spelling	ir-20.500.12258-154492021-12-01T09:53:33Z Construction of simple path graphs in transport networks: I. general solutions and examples Golovinskii, I. A. Головинский, И. А. Biconnected components Undirected graph Transport networks Real-time management Path graphs General solutions Disjoint sets Complete solutions Complete solutions Graph theory The calculation of the set of all simple paths connecting two vertices of an undirected graph is considered. The more general problems of connecting vertices which belong to disjoint sets of vertices in a graph by all simple paths are also investigated. The connection between these problems and finding vertex biconnected components and graph bridges is established, and based on this their complete solutions are given. Simplifying techniques for the calculation of the sets of paths based on the addition of auxiliary edges and vertices to the analyzed graph are proposed. Examples of the application of the developed apparatus to problems of the real-time management of transport networks are given 2021-03-16T13:10:10Z 2021-03-16T13:10:10Z 2021 Статья Golovinskii, I.A. Construction of simple path graphs in transport networks: i. general solutions and examples // Journal of Computer and Systems Sciences International. - 2021. - Volume 60. - Issue 1. - Pages 118-152 http://hdl.handle.net/20.500.12258/15449 en Journal of Computer and Systems Sciences International application/pdf application/pdf Pleiades journals
institution	СКФУ
collection	Репозиторий
language	English
topic	Biconnected components Undirected graph Transport networks Real-time management Path graphs General solutions Disjoint sets Complete solutions Complete solutions Graph theory
spellingShingle	Biconnected components Undirected graph Transport networks Real-time management Path graphs General solutions Disjoint sets Complete solutions Complete solutions Graph theory Golovinskii, I. A. Головинский, И. А. Construction of simple path graphs in transport networks: I. general solutions and examples
description	The calculation of the set of all simple paths connecting two vertices of an undirected graph is considered. The more general problems of connecting vertices which belong to disjoint sets of vertices in a graph by all simple paths are also investigated. The connection between these problems and finding vertex biconnected components and graph bridges is established, and based on this their complete solutions are given. Simplifying techniques for the calculation of the sets of paths based on the addition of auxiliary edges and vertices to the analyzed graph are proposed. Examples of the application of the developed apparatus to problems of the real-time management of transport networks are given
format	Статья
author	Golovinskii, I. A. Головинский, И. А.
author_facet	Golovinskii, I. A. Головинский, И. А.
author_sort	Golovinskii, I. A.
title	Construction of simple path graphs in transport networks: I. general solutions and examples
title_short	Construction of simple path graphs in transport networks: I. general solutions and examples
title_full	Construction of simple path graphs in transport networks: I. general solutions and examples
title_fullStr	Construction of simple path graphs in transport networks: I. general solutions and examples
title_full_unstemmed	Construction of simple path graphs in transport networks: I. general solutions and examples
title_sort	construction of simple path graphs in transport networks: i. general solutions and examples
publisher	Pleiades journals
publishDate	2021
url	https://dspace.ncfu.ru/handle/20.500.12258/15449
work_keys_str_mv	AT golovinskiiia constructionofsimplepathgraphsintransportnetworksigeneralsolutionsandexamples AT golovinskijia constructionofsimplepathgraphsintransportnetworksigeneralsolutionsandexamples
_version_	1760599253506326528

Construction of simple path graphs in transport networks: I. general solutions and examples

Benzer Materyaller