Filters
Modification of Graph Algorithms (from Jarník to searching)
The article deals with the relation ship between Jarník`s solution of the minimum spanning tree problem and searching algorithms - Depth First Search and Breadth First Search. These algorithms are used by ...
BB - Aplikovaná statistika, operační výzkum
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
PROBLEM OF SEARCHING THE MST
as a new element, and shows how it could be used for searching for the Minimum Spanning Tree of the graph. This creates a new procedure for searching for the Minimum Spanning Tree of the graph which completes prev...
Pure mathematics
- 2017 •
- D
Rok uplatnění
D - Stať ve sborníku
Quantum-walk-based state-transfer algorithms on the complete M-partite graph
We investigate coined quantum-walk search and state-transfer algorithms, focusing on the complete M-partite graph with N vertices in each partition. First, it is shown that by adding a loop to each vertex, the search
Optics (including laser optics and quantum optics)
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Directed elimination games
width from an algorithmic and graph searching perspective. fulfilled their promise for broad algorithmic applications on directed graphs. One of elimination width and a corresponding graph se...
IN - Informatika
- 2016 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Shortest Path Problem Algorithms
This article discusses the algorithms used for finding the shortest path graph. There are described Dijkstra's algorithm, Floyd ? Warshall algorithm, Bellman ? Ford algorithm and the A-star algorithm
IN - Informatika
- 2011 •
- D
Rok uplatnění
D - Stať ve sborníku
Graph algorithms in mutual contexts
as Combinatorial or Discrete Optimization close connected with Graph Theory and Computer familiar with combinatorial algorithms in contexts to be able to get deeper into each problem and entirely understand it. This paper illustrat...
BB - Aplikovaná statistika, operační výzkum
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
Safety in logistic transport chains using theory of graphs
is searching the most reliable paths in the transport networks. In this article there is the explanation of algorithm for searching the most reliable paths in undirected graphs which are models of real transport n...
BB - Aplikovaná statistika, operační výzkum
- 2012 •
- D
Rok uplatnění
D - Stať ve sborníku
Using Case-Based Reasoning and Graph Searching Algorithms for Mobile Robot Path Planning
combining pathsin the case graph with paths found by the A* algorithm. We present of the path planning is searching for a path from a start to a goal position without propose path planning methods based on using a case
JD - Využití počítačů, robotika a její aplikace
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Improvement of shortest path algorithms through graph partitioning
problem of finding of optimal paths in road networks. This paper presents an algorithm based upon traditional graph algorithms, like the Dijkstra's shortest path algorithm modification of algorithm partit...
IN - Informatika
- 2011 •
- D
Rok uplatnění
D - Stať ve sborníku
Sort and Search: Exact algorithms for generalized domination
We describe techniques for solving existence, optimization and counting problems related to generalized domination in graphs.
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 53 801