Sciweavers

6413 search results - page 4 / 1283
» Classes of cycle bases
Sort
View
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 9 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
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...
Stefan Kratsch, Magnus Wahlström
JAIR
1998
92views more  JAIR 1998»
13 years 7 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
SECON
2007
IEEE
14 years 1 months ago
Adaptive Control of Duty Cycling in Energy-Harvesting Wireless Sensor Networks
—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....
ISBI
2011
IEEE
12 years 11 months ago
Network cycle features: Application to computer-aided Gleason grading of prostate cancer histopathological images
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...
CAAN
2006
Springer
13 years 11 months ago
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
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...
Boris Goldengorin, Gerold Jäger, Paul Molitor