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: | , |
---|---|
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!
|