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...
Αποθηκεύτηκε σε:
Κύριοι συγγραφείς: | , |
---|---|
Μορφή: | Статья |
Γλώσσα: | English |
Έκδοση: |
PLEIADES PUBLISHING INC
2021
|
Θέματα: | |
Διαθέσιμο Online: | https://dspace.ncfu.ru/handle/20.500.12258/18461 |
Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|