Implicit graphs

MaRDI QIDQ2866493zbMATH OpenFDO

Authors Mathias Hiron

Publication date 13 December 2013

Published in Quadrature (Search for Journal in Brave)

zbMATH Keywords

breadth first searchDijkstra's algorithmdirected acyclic graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1923047
• The complexity of searching implicit graphs
• scientific article; zbMATH DE number 3988689
• scientific article; zbMATH DE number 4121464
• Probability graphs

Cited in

(1)

• Implicit Component-Graph: A Discussion

This page was built for publication: Implicit graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866493)