Construction of simple path graphs in transport networks. I: General solutions and examples

DOI10.1134/S1064230721010068zbMath1458.90193OpenAlexW3132725327MaRDI QIDQ1995394

I. A. Golovinskiĭ

Publication date: 23 February 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/s1064230721010068

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)

Related Items (1)

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

Cites Work

• The critical node detection problem in networks: a survey
• \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs
• Detecting critical node structures on graphs: A mathematical programming approach
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of simple path graphs in transport networks. I: General solutions and examples