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...
保存先:
主要な著者: | Golovinskii, I. A., Головинский, И. А. |
---|---|
フォーマット: | Статья |
言語: | English |
出版事項: |
PLEIADES PUBLISHING INC
2021
|
主題: | |
オンライン・アクセス: | https://dspace.ncfu.ru/handle/20.500.12258/18461 |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
Construction of simple path graphs in transport networks: I. general solutions and examples
著者:: Golovinskii, I. A., 等
出版事項: (2021) -
Software Implementation of an Algorithm on Graphs to Determine the Structural Reliability of Electrical Power Systems
著者:: Demin, M. S., 等
出版事項: (2023) - Программирование. Модуль GRAPH. Модульное и объектное программирование учебно-методическое пособие
-
Разработка бизнес-решений с помощью Microsoft InfoPath
著者:: Халстед П., 等 -
Research of transport logistics methods in road construction
著者:: Kulagovskaya, T. A., 等
出版事項: (2021)