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 3 of 3 for “"vertex partitions"”.
-
OPTIMISATION AND INTERDICTION PROBLEMS FOR NETWORK SAFETY
… optimisation problem that seeks to identify vertex partitions satisfying specific dominance constraints between the parts. For this problem, we propose an exact combinatorial branch-and-bound algorithm alongside several randomised heuristics. Next, we introduce a family of Binary Interdiction …
-
Tilings and other combinatorial results
… copies of $P$. The third tiling problem is about vertex-partitions of the hypercube graph $Q_n$. Offner asked: if $G$ is a subgraph of $Q_n$ such $|G|$ is a power of $2$, must $V(Q_d)$, for some $d$, admit a partition into isomorphic copies of $G$? In Chapter 4 we answer this question in the …
-
Partitioning A Graph In Alliances And Its Application To Data Clustering
… a set of vertices in the graph, such that every vertex in the set is adjacent to equal or more vertices inside the set than the vertices outside it. We study the problem of partitioning a graph into alliances and identify classes of graphs that have such a partition. We present results on the …