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...
Kaydedildi:
Asıl Yazarlar: | Golovinskii, I. A., Головинский, И. А. |
---|---|
Materyal Türü: | Статья |
Dil: | English |
Baskı/Yayın Bilgisi: |
PLEIADES PUBLISHING INC
2021
|
Konular: | |
Online Erişim: | https://dspace.ncfu.ru/handle/20.500.12258/18461 |
Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Benzer Materyaller
-
Construction of simple path graphs in transport networks: I. general solutions and examples
Yazar:: Golovinskii, I. A., ve diğerleri
Baskı/Yayın Bilgisi: (2021) -
Software Implementation of an Algorithm on Graphs to Determine the Structural Reliability of Electrical Power Systems
Yazar:: Demin, M. S., ve diğerleri
Baskı/Yayın Bilgisi: (2023) - Программирование. Модуль GRAPH. Модульное и объектное программирование учебно-методическое пособие
-
Разработка бизнес-решений с помощью Microsoft InfoPath
Yazar:: Халстед П., ve diğerleri -
Research of transport logistics methods in road construction
Yazar:: Kulagovskaya, T. A., ve diğerleri
Baskı/Yayın Bilgisi: (2021)