ON THE NUMBER OF SOLUTIONS OF CERTAI
寻找无向图中回路的并行算法

Let G=(V,E),|V|=n,|E|=m, be an undirected simple graph, NC algorithms are given for following problems: (1) finding a shortest circuit in G ; (2) finding a shortest circuit of even (odd) length in G ; and (3) finding a C k , k =3,4, where C k is the circuit in G of k edges.