Restricted Cycle Problems with Applications
Steven Skiena · 1997
Abstract : This progress report covers the first six months of funding on this grant. This grant covers two distinct lines of work: (1) research on the algorithmic complexity of path and cycle problems in graphs, and (2) implementations of graph algorithms as part of large scale environments for combinatorial computing. As detailed below, substantial progress has been made in both areas since the commencement of funding.