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...
Sábháilte in:
Príomhchruthaitheoirí: | Golovinskii, I. A., Головинский, И. А. |
---|---|
Formáid: | Статья |
Teanga: | English |
Foilsithe / Cruthaithe: |
PLEIADES PUBLISHING INC
2021
|
Ábhair: | |
Rochtain ar líne: | https://dspace.ncfu.ru/handle/20.500.12258/18461 |
Clibeanna: |
Cuir clib leis
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|
Míreanna comhchosúla
-
Construction of simple path graphs in transport networks: I. general solutions and examples
de réir: Golovinskii, I. A., et al.
Foilsithe / Cruthaithe: (2021) -
Software Implementation of an Algorithm on Graphs to Determine the Structural Reliability of Electrical Power Systems
de réir: Demin, M. S., et al.
Foilsithe / Cruthaithe: (2023) - Программирование. Модуль GRAPH. Модульное и объектное программирование учебно-методическое пособие
-
Разработка бизнес-решений с помощью Microsoft InfoPath
de réir: Халстед П., et al. -
Research of transport logistics methods in road construction
de réir: Kulagovskaya, T. A., et al.
Foilsithe / Cruthaithe: (2021)