Construction of simple path graphs in transport networks: I. general solutions and examples
The calculation of the set of all simple paths connecting two vertices of an undirected graph is considered. The more general problems of connecting vertices which belong to disjoint sets of vertices in a graph by all simple paths are also investigated. The connection between these problems and find...
Сохранить в:
Главные авторы: | Golovinskii, I. A., Головинский, И. А. |
---|---|
格式: | Статья |
语言: | English |
出版: |
Pleiades journals
2021
|
主题: | |
在线阅读: | https://dspace.ncfu.ru/handle/20.500.12258/15449 |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
Construction of simple path graphs in transport networks: II. Analysis of graphs' biconnectivity
由: Golovinskii, I. A., и др.
出版: (2021) -
Software Implementation of an Algorithm on Graphs to Determine the Structural Reliability of Electrical Power Systems
由: Demin, M. S., и др.
出版: (2023) -
Estimates of mild solutions of navier–stokes equations in weak herz-type besov–morrey spaces
由: Abdulkadirov, R. I., и др.
出版: (2022) -
Temperature-related changes in the structure of YSAG:Yb garnet solid solutions with high Sc3+ concentration
由: Nikova, M. S., и др.
出版: (2019) - Программирование. Модуль GRAPH. Модульное и объектное программирование учебно-методическое пособие