Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"cycle cover"”.
-
Small cycle cover, group coloring with related problems
… n ≥ 3 vertices, then the edges of G can be covered by at most 2n-33 cycles. In Chapter 2, a result on small cycle cover is obtained and we also show that the result is as best as possible.;Thomassen conjectured that every 4-connected line graph is hamiltonian. In Chapters 3 and 4, we apply …
-
Utilization of common buckwheat as a short-cycle cover crop before direct-seeded processing cucumber production
… One alternative method is utilizing short-cycle summer cover crops, such as common buckwheat (Fagopyrum esculentum) prior to planting cucumber. However, this needs to be tested to assess any potentially negative influences of buckwheat on cucumber yields. To examine the effects of buckwheat …
-
Effectiveness of mustard short-cycle cover crops for management of Phytophthora capsici and Fusarium spp. in cucurbits
This research was conducted to determine the effectiveness of mustard Brassica juncea L. ‘Florida Broadleaf’ (FBL) and Sinapis alba L. ‘Tilney’ for management of Phytophthora capsici and Fusarium spp. in cucurbits. To accomplish this goal laboratory, greenhouse, and field studies were conducted …
-
Facility location and the analysis of algorithms through factor-revealing programs
… them to analyze the approximation factors of a cycle cover algorithm and a Steiner packing algorithm, as well as the competitive factor of an online buffer management algorithm. We also use our algorithms and other techniques to improve the approximation factors of several variants of the UFLP. …
-
Linear Orderings of Sparse Graphs
… Feedback Arc Set problem and forms a minimum Cycle Cover. Linear Ordering and Feedback Arc Set are classic NP-hard optimization problems and have a wide range of applications. Whereas both problems have been studied intensively on dense graphs and tournaments, not much is known about their …