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...
Wedi'i Gadw mewn:
Prif Awduron: | Golovinskii, I. A., Головинский, И. А. |
---|---|
Fformat: | Статья |
Iaith: | English |
Cyhoeddwyd: |
PLEIADES PUBLISHING INC
2021
|
Pynciau: | |
Mynediad Ar-lein: | https://dspace.ncfu.ru/handle/20.500.12258/18461 |
Tagiau: |
Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|
Eitemau Tebyg
-
Construction of simple path graphs in transport networks: I. general solutions and examples
gan: Golovinskii, I. A., et al.
Cyhoeddwyd: (2021) -
Software Implementation of an Algorithm on Graphs to Determine the Structural Reliability of Electrical Power Systems
gan: Demin, M. S., et al.
Cyhoeddwyd: (2023) - Программирование. Модуль GRAPH. Модульное и объектное программирование учебно-методическое пособие
-
Разработка бизнес-решений с помощью Microsoft InfoPath
gan: Халстед П., et al. -
Research of transport logistics methods in road construction
gan: Kulagovskaya, T. A., et al.
Cyhoeddwyd: (2021)