Add to ORKGIn this document, we explore the complexity of the shortest path problem in a layered directed acyclic graph under consistency constraints. In this context, a consistency constraint imposes that the optimal path select nodes with the same labels in some layers of the graph. We show that this problem is NP-Hard by reducing the 3-SAT problem to it
This paper presents new algorithms for computing shortest paths in a nearly acyclic directed graph G...
: In this paper we analyse the labelling algorithm for the multiobjective shortest path problem co...
Considering directed graphs on n vertices and m edges with real (possibly negative) weights, we pres...
In this document, we explore the complexity of the shortest path problem in a layered directed acycl...
We consider the problem of layering Directed Acyclic Graphs, an NP-hard problem. We show that some u...
Abuaiadh and Kingston gave an efficient algorithm for the single source shortest path problem for a ...
Abuaiadh and Kingston gave an efficient algorithm for the single source shortest path problem for a...
AbstractAbuaiadh and Kingston gave an efficient algorithm for the single source shortest path proble...
AbstractShortest path problems can be solved very efficiently when a directed graph is nearly acycli...
AbstractIn this paper we shall determine the minimal number of comparisons required for the solution...
The shortest path tour problem (SPTP) consists in finding a shortest path from a given origination n...
The shortest path tour problem (SPTP) consists of finding a shortest path from a given origin node s...
AbstractDijkstra's algorithm solves the single-source shortest path problem on any directed graph in...
In this paper, we study the constrained shortest path tour problem. Given a directed graph with non-...
We consider a wide class of shortest path problems in acyclic digraphs. In the problems, the length ...
This paper presents new algorithms for computing shortest paths in a nearly acyclic directed graph G...
: In this paper we analyse the labelling algorithm for the multiobjective shortest path problem co...
Considering directed graphs on n vertices and m edges with real (possibly negative) weights, we pres...
In this document, we explore the complexity of the shortest path problem in a layered directed acycl...
We consider the problem of layering Directed Acyclic Graphs, an NP-hard problem. We show that some u...
Abuaiadh and Kingston gave an efficient algorithm for the single source shortest path problem for a ...
Abuaiadh and Kingston gave an efficient algorithm for the single source shortest path problem for a...
AbstractAbuaiadh and Kingston gave an efficient algorithm for the single source shortest path proble...
AbstractShortest path problems can be solved very efficiently when a directed graph is nearly acycli...
AbstractIn this paper we shall determine the minimal number of comparisons required for the solution...
The shortest path tour problem (SPTP) consists in finding a shortest path from a given origination n...
The shortest path tour problem (SPTP) consists of finding a shortest path from a given origin node s...
AbstractDijkstra's algorithm solves the single-source shortest path problem on any directed graph in...
In this paper, we study the constrained shortest path tour problem. Given a directed graph with non-...
We consider a wide class of shortest path problems in acyclic digraphs. In the problems, the length ...
This paper presents new algorithms for computing shortest paths in a nearly acyclic directed graph G...
: In this paper we analyse the labelling algorithm for the multiobjective shortest path problem co...
Considering directed graphs on n vertices and m edges with real (possibly negative) weights, we pres...