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...
Spremljeno u:
Glavni autori: | Golovinskii, I. A., Головинский, И. А. |
---|---|
Format: | Статья |
Jezik: | English |
Izdano: |
PLEIADES PUBLISHING INC
2021
|
Teme: | |
Online pristup: | https://dspace.ncfu.ru/handle/20.500.12258/18461 |
Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|
Similar Items
-
Construction of simple path graphs in transport networks: I. general solutions and examples
od: Golovinskii, I. A., i dr.
Izdano: (2021) -
Software Implementation of an Algorithm on Graphs to Determine the Structural Reliability of Electrical Power Systems
od: Demin, M. S., i dr.
Izdano: (2023) - Программирование. Модуль GRAPH. Модульное и объектное программирование учебно-методическое пособие
-
Разработка бизнес-решений с помощью Microsoft InfoPath
od: Халстед П., i dr. -
Research of transport logistics methods in road construction
od: Kulagovskaya, T. A., i dr.
Izdano: (2021)