All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

-
19912025

Join usingOrAnd

Join usingOrAnd

SelectAll/None

    • Show more

SelectAll/None

    • Show more

        • Show more

        • Show more

        • Show more

        • Show more

      • Show more

SelectAll/None

    • Show more

More filters

Results

98 709 results (0,373s) •

Result

The shortest path

This paper describes the shortest path problem, its classification and the best known algorithms. A new algorithm for shortest path problem is introduced and its acceleration suggested....

BA - Obecná matematika

  • 2005
    • •
  • D
Result

The Geodesic Shortest Path

In the geodesic shortest path problem we have to find the shortest path between two points on the surface so that the path leads along the surface. In the article, the description and solution of ...

BA - Obecná matematika

  • 2007
    • •
  • D
Result

Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters

The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem is known fpt algorithms for the problem

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2021
    • •
  • D
    • •
  • Link
Result

Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters

The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem is known to be NP-complete and W[2]-hard with ...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2023
    • •
  • Jimp
    • •
  • Link
Result

Application of Self-Organizing Migrating Algorithm on the Shortest Path Problem

Traditionally, the shortest path in a weighted graph problem is solved by well-known algorithms such as Dijkstra's, Floyd-Warshall, Bellman-Ford algorithms of such approach. For this purpose, a sample weighted graph was def...

BB - Aplikovaná statistika, operační výzkum

  • 2012
    • •
  • D
Result

An Efficient Algorithm for All-Pairs Shortest Paths Problem

The All-Pairs Shortest Paths Problem that finds shortest paths between all pairs of vertices in a connected weighted graph is usually solved by the Floyd-Warshall algorithm based on dynamic programming app...

BB - Aplikovaná statistika, operační výzkum

  • 2002
    • •
  • D
Result

Polynomial kernels for tracking shortest paths

k, Tracking Shortest Paths requires deciding whether there exists a set of k vertices T ? V such that for any two distinct shortest paths between s and t, say P1 and edges in planar graphs for the Tracking Pat...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2023
    • •
  • Jimp
    • •
  • Link
Result

Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs

In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. We propose a modification of the shortest paths approximation based on the f...

BB - Aplikovaná statistika, operační výzkum

  • 2006
    • •
  • Jx
Result

Improving shortest paths in the Delaunay triangulation

We study a problem about shortest paths in Delaunay triangulations. Given two (not in S) that can be added, such that the shortest path from s to t, in the Delaunay of the problem, and give effici...

BA - Obecná matematika

  • 2012
    • •
  • Jx
    • •
  • Link
Result

Finding Shortest Paths

Many practical problems are based on finding shortest paths among all pairs of given points. This problem is usually solved by the Floyd-Warshall algorithm. In this paper is shown that in the case when all edges ha...

BB - Aplikovaná statistika, operační výzkum

  • 2003
    • •
  • D
  • 1 - 10 out of 98 709