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 4 of 4 for “"Longest path problem"”.
-
Graphical algorithms for solving minimal cost network flow problems and applications
… These include the minimal cost network flow problem, the shortest path problem, the traveling salesman problem, and a scheduling problem (longest path problem).</p>
-
Χαρακτηρισμός νέων κλάσεων τέλειων γραφημάτων και αγλόριθμοι χρωματισμού και μέγιστων διαδρομών
… results for various types of the coloring problem on graphs and polynomial-time algorithms for the longest path problem on perfect graphs. In particular, motivated by the de nition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology, we …
-
Triangles, Long Paths, and Covered Sets
… the P3-game in which Maker tries to build a path of length 3. First, we show that the methods of chapter 2 are not applicable in this scenario and give an intuition why that might be the case. Then, we give a more simple counting argument to bound the threshold bias. In chapter 4, we consider …
-
Special versus standard algorithms for large-scale harvest scheduling problems
… for solving large-scale harvest scheduling problems. We discover that the harvest scheduling problem involving area constraints possesses a network structure. In Model I-Form 1, the network constraints form a separable block diagonal structure, which permits one to solve for the decision …