The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
—Increasingly many wireless sensor network deployments are using harvested environmental energy to extend system lifetime. Because the temporal profiles of such energy sources e...
Christopher M. Vigorito, Deepak Ganesan, Andrew G....
Features extracted from cell networks have become popular tools in histological image analysis. However, existing features do not take sufficient advantage of the cycle structure...
Parmeshwar Khurd, Leo Grady, Ali Kamen, Summer Gib...
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...