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 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|