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 13 of 13 for “"grid graphs"”.
-
Liar's Domination in Grid Graphs
… P_3 x P_infty. We also give bounds for other grid graphs.</p>
-
Paired-Domination in Grid Graphs.
… set. Determining the domination number for grid graphs is a well-known open problem in graph theory. Not surprisingly, determining the paired-domination number for grid graphs is also a difficult problem. In this thesis, we survey past research in domination, paired-domination and grid …
-
Various pushing methods on grid graphs
… thesis describes algorithms for determining if a grid of switches can be turned into all-off state from any initial configuration by various methods of activation operation (push). Among these push methods, besides the regular "+" push, "+" push with no center, "X" push, "X" push with no center, …
-
Hamiltonian cycle and related problems : vertex-breaking, grid graphs, and Rubik's Cubes
… some space (i.e., a configuration graph or a grid) must be traversed in a single path or cycle subject to local constraints. When proving such a problem NP-hard, a reduction from TRVB can often be used as a simpler alternative to reducing from a hard variant of Hamiltonian Cycle. Next, we …
-
Algorithms for DFM in electronic design automation
… the k-colorability of rectangular and diagonal grid graphs as induced subgraphs of a rectangular or diagonal grid respectively, since it has direct applications in printing contact/via layouts. It remains an open question on how hard it is to color grid graphs due to their regularity and …
-
Multichannel Communication and Graph Vertex Labeling Problems
… the problem of bandwidth optimization of Hamming graphs (Cartesian products of cliques). The graph problem has been open since the 1960s. In this thesis, we demonstrate lower bounds and a nearly optimal solution to this problem. Using techniques developed for this solution, we give an algorithm …
-
Alliance Partitions in Graphs.
… values for the alliance partition number of grid graphs and for the global alliance partition number of caterpillars.</p>
-
From String to Structure: Graph Threading for Physical Assembly
… complexity landscape, proving NP-hardness for graphs of maximum degree 4, tractability for degree 3, and giving exact and approximation algorithms for restricted variants, including rectangular grid graphs. Finally, we turn from theory to fabrication, proposing multi-configuration threading—a …
-
Minimax estimation with structured data : shape constraints, causal models, and optimal transport
… graph structures, including higher-dimensional grid-graphs. For the estimation of Monge matrices, we give near minimax rates for their estimation, including the case where latent permutations act on the rows and columns of the matrix. In the latter case, we also give two computationally …
-
In solving the dominating set problem : group theory approach
… sets of an orbit graph. The program analyzed grid graphs and football pool graphs, and was able to find the minimum dominating sets of any m x n grid graph for m X 10 and n X 11. For the football pool problem, we have determined that the automorphism group of n matches is S 3 [Special …
-
Resilient and Risk-Averse Network Systems
Graphs are versatile modeling tools capable of effectively representing real-world systems by capturing individual components and their intricate interactions. The main objective of this research is to formulate and develop efficient solution methodologies for graph-theoretical problems involving …
-
Graph Neural Networks for Multi-Agent Learning
… models can manifest in the form of CNNs (on grid graphs), RNNs (on line graphs), and Transformers (on fully connected graphs). However, all of these architectures can be subsumed as special cases under graph neural networks (GNNs), a framework for operating over any graph-structured data. …
-
A Multi-Dimensional Width-Bounded Geometric Separator and its Applications to Protein Folding
… geometric separator. We proved that for a grid graph G with n grid points P, there exists a balanced separator A subseteq P$ such that A has less than or equal to 1.02074 sqrt{n} points, and G-A has two disconnected subgraphs with less than or equal to {2over 3}n nodes on each subgraph. We …