A new algebraic approach to finding all simple paths and cycles in undirected graphs.

Runtao Yang Rui Gao Chengjin Zhang

Published in: ICIA (2015)

Keyphrases

undirected graph
disjoint paths
directed acyclic graph
shortest path
pairwise
upper bound
higher order
strongly connected