Login / Signup
A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph.
Zbigniew Lonc
Pawel Naroski
Published in:
Discret. Math. Theor. Comput. Sci. (2012)
Keyphrases
</>
strongly connected
directed graph
optimum path forest
random walk
higher order
pairwise
undirected graph
information systems
image segmentation
state space
high order