An instance of the NP-hard Quadratic Shortest Path Problem (QSPP) is cal...
We solve the recognition problem (RP) for the class of Demidenko matrice...
This article studies the Minimum Spanning Tree Problem under Explorable
...
In the path version of the Travelling Salesman Problem (Path-TSP), a sal...
If a graph G can be represented by means of paths on a grid, such that e...
A graph G is called an edge intersection graph of paths on a grid if the...