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
|
Θέματα: | |
Διαθέσιμο Online: | 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)