Algorithmic Traversals of Infinite Graphs

23 Oct 2018 Bhaskar Siddharth Kienzle Anton Jay

A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-first and depth-first traversals, are computed by various graph searching algorithms... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • LOGIC
  • COMBINATORICS