On the Maximal Shortest Paths Cover Number
A shortest path <i>P</i> of a graph <i>G</i> is maximal if <i>P</i> is not contained as a subpath in any other shortest path. A set <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics>&...
Main Authors: | Iztok Peterin, Gabriel Semanišin |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-07-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/14/1592 |
Similar Items
-
K Shortest Path Implementation
by: Nagubadi, RadhaKrishna
Published: (2013) -
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem
by: Ovidiu Cosma, et al.
Published: (2021-01-01) -
An Algorithm for the Cycled Shortest Path Problem
by: Amir Salehipour, et al.
Published: (2011-07-01) -
Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
by: Nur Syuhada Muhammat Pazil, et al.
Published: (2020-11-01) -
Performance of shortest path algorithm based on parallel vertex traversal
by: Vesović Mihailo, et al.
Published: (2016-01-01)