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
|
| विषय: | |
| ऑनलाइन पहुंच: | https://dspace.ncfu.ru/handle/20.500.12258/18461 |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|