Add to ORKGThree algorithms for finding the shortest path between two vertices with arbitrary labels of any fractal graph Hanoi S(k, n) and the exact estimation of the minimal distance between these vertices for the case k ≥ 3 and n ˂ k are proposed
This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue o...
[[abstract]]Given an edge-weighted undirected graph G and two prescribed vertices u and v, a next-to...
We propose shortest path algorithms that use A ∗ search in combination with a new graph-theoretic lo...
We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the...
AbstractIt is known that in the Tower of Hanoi graphs there are at most two different shortest paths...
We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest (u, v)-pa...
It is known that in the Tower of Hanoi graphs there are at most two different shortest paths between...
summary:For any $n\ge 1$ and any $k\ge 1$, a graph $S(n,k)$ is introduced. Vertices of $S(n,k)$ are ...
The aim of this thesis is finding, comparing and implementation of algorithms for finding the shorte...
The shortest path problem is a problem related to the sum of edges weights in a graph. In this fina...
AbstractFor integer r≥2, the infinite r-path P∞(r) is the graph on vertices …v−3,v−2,v−1,v0,v1,v2,v3...
An L(2, 1)-labelling of a graph G is a function f from the vertex set V(G) to the set of all nonnega...
Sierpiński graphs Snp form an extensively studied family of graphs of fractal nature applicable in ...
Abstract Given a simple graph G on n vertices, let σ2(G) be the minimum sum of the degrees of any tw...
AbstractGiven n and i, n > 2, 2 ≤ i ≤ n − 1, the smallest size of an n-graph without endvertices is ...
This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue o...
[[abstract]]Given an edge-weighted undirected graph G and two prescribed vertices u and v, a next-to...
We propose shortest path algorithms that use A ∗ search in combination with a new graph-theoretic lo...
We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the...
AbstractIt is known that in the Tower of Hanoi graphs there are at most two different shortest paths...
We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest (u, v)-pa...
It is known that in the Tower of Hanoi graphs there are at most two different shortest paths between...
summary:For any $n\ge 1$ and any $k\ge 1$, a graph $S(n,k)$ is introduced. Vertices of $S(n,k)$ are ...
The aim of this thesis is finding, comparing and implementation of algorithms for finding the shorte...
The shortest path problem is a problem related to the sum of edges weights in a graph. In this fina...
AbstractFor integer r≥2, the infinite r-path P∞(r) is the graph on vertices …v−3,v−2,v−1,v0,v1,v2,v3...
An L(2, 1)-labelling of a graph G is a function f from the vertex set V(G) to the set of all nonnega...
Sierpiński graphs Snp form an extensively studied family of graphs of fractal nature applicable in ...
Abstract Given a simple graph G on n vertices, let σ2(G) be the minimum sum of the degrees of any tw...
AbstractGiven n and i, n > 2, 2 ≤ i ≤ n − 1, the smallest size of an n-graph without endvertices is ...
This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue o...
[[abstract]]Given an edge-weighted undirected graph G and two prescribed vertices u and v, a next-to...
We propose shortest path algorithms that use A ∗ search in combination with a new graph-theoretic lo...