Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity

DOI10.1134/S1064230721020040zbMath1476.90075OpenAlexW3159847892MaRDI QIDQ2239174

I. A. Golovinskiĭ

Publication date: 3 November 2021

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230721020040

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Construction of simple path graphs in transport networks. I: General solutions and examples
• \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity