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)