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

DOI10.1134/S1064230721010068zbMATH Open1458.90193OpenAlexW3132725327MaRDI QIDQ1995394FDOQ1995394

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)

Cites Work

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

Cited In (1)

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

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)