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

DOI10.1134/S1064230721010068MaRDI QIDQ1995394zbMATH OpenOpenAlexFDO

Authors 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) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Communication networks in operations research (90B18)

Recommendations

• Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity
• Publication:3487428
• scientific article; zbMATH DE number 1062936
• An Appraisal of Some Shortest-Path Algorithms
• Graphs and graph algorithms

Cites work

• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 46669 (Why is no real title available?)
• scientific article; zbMATH DE number 49741 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Depth-First Search and Linear Graph Algorithms
• Detecting critical node structures on graphs: a mathematical programming approach
• The critical node detection problem in networks: a survey
• \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs

Cited in

(2)

• Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity
• scientific article; zbMATH DE number 4158666 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1995394)