The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph

In this paper, we study undirected multiple graphs of any natural multiplicity $k>1$. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of $k$ linked edges, which connect 2 or $(k+1)$ vertices, correspondingly. The linked ed...

Full description

Bibliographic Details

Published in:	Modelirovanie i analiz informacionnyh sistem Vol. 30; no. 1; pp. 6 - 15
Main Author:	Smirnov, Alexander Valeryevich
Format:	Journal Article
Language:	English
Published:	Yaroslavl State University 28.04.2023
Subjects:	multiple graph multiple path polynomial algorithm reachability set shortest path
ISSN:	1818-1015, 2313-5417
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!