Implicit graphs (Q2866493)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Implicit graphs |
scientific article; zbMATH DE number 6238315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implicit graphs |
scientific article; zbMATH DE number 6238315 |
Statements
13 December 2013
0 references
breadth first search
0 references
Dijkstra's algorithm
0 references
directed acyclic graph
0 references
Implicit graphs (English)
0 references
In the paper under review, the author shows by simple examples that graphs can be used to formalize problems of various types. As graphs are extensively studied and many efficient algorithms have been developed, in many cases the solution of the original problem can be determined by applying some standard algorithm. In the examples, the author applies the Breadth First Search algorithm, Dijkstra's algorithm and dynamic algorithms.
0 references
0.7335936427116394
0 references
0.7119751572608948
0 references
