A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph
A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph
Discrete Algorithms By an Euler walk in a 3-uniform hypergraph H we mean an alternating sequence v(0), epsilon(1), v(1), epsilon(2), v(2), ... , v(m-1), epsilon(m), v(m) of vertices and edges in H such that each edge of H appears in this sequence exactly once and v(i-1); v(i) is an element …