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 20 of 207 for “"bipartite graph"”.
-
Improving group role assignment problem by incremental assignment algorithm
… optimization problem. In a weighted bipartite graph, the Assignment Problem is to find a largest sum of weights matching. The Hungarian method is a well-known algorithm which is combinatorial optimization. Adding a new row and a new column to a weighted bipartite graph is called the …
-
Sample-Based Estimation of Node Similarity in Streaming Bipartite Graphs
… the estimation of node similarity in streaming bipartite graph. As an important model in many applications of data mining, the bipartite graph represents the relationships between two sets of non-interconnected nodes, e.g. customers and the products/services they buy, users and the events/groups …
-
Graph factors and Hamiltonian decompositions.
… and sufficient condition is obtained for a bipartite graph to have an f-factor which includes a designated set of edges and is disjoint from another designated set of edges. Various other characterizations are obtained for similar subgraph structures, and a characterization is obtained for a …
-
Graphs on which dihedral, quaternion, and abelian groups act vertex and/or edge transitively and applications to tensor products
"The graphs on which dihedral, quaternion, and abelian groups act vertex and/or edge transitivity are completely characterized. The vertex transitive graphs belong to one of three families--the well known circulant graphs, the metacirculant graphs constructured by Alspach and Parsons, and a family …
-
Rigidity of toric varieties associated to bipartite graphs
One can associate to a bipartite graph a so-called edge ring and its spectrum is an affine normal toric variety. We first characterize the faces of the (edge) cone associated to this toric variety in terms of certain independent sets of the bipartite graph. Then, we give first examples of rigid …
-
Hyperfinite transversal theory
… gives a necessary and sufficient condition for a bipartite graph $\Gamma$ to possess a matching f. (A bipartite graph $\Gamma$ is a subset of the cartesian product of two finite sets X and Y. A matching f of $\Gamma$ is a 1-1 function f which is a subset of $\Gamma$ and which has the same domain …
-
Stationary Automata
… allows us to make a connection with infinite graph theory. Aharoni, Nash-Williams, and Shelah [AhNaSh] formulated a condition that is necessary and sufficient for a bipartite graph to have a matching. For a bipartite graph G=( M,W,E ) , we define a language over the alphabet { M,W } . We …
-
Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs
… has been known for some time that connected non-bipartite graphs have unique prime factorizations over the direct product, the same cannot be said of bipartite graphs. This is somewhat vexing, as bipartite graphs do have unique prime factorizations over other graph products (the Cartesian …
-
Restricted and Unrestricted Coverings of Complete Bipartite Graphs with Hexagons
A minimal covering of a graph G with isomorphic copies of graph H is a set {H1, H2, H3, ... , Hn} where Hi is isomorphic to H, the vertex set of Hi is a subset of G, the edge set of G is a subset of the union of Hi's, and the cardinality of the union of Hi's minus G is minimum. Some studies have …
-
Approximate edge 3-coloring of cubic graphs
… 3-coloring polynomial time algorithm for cubic graphs. For any cubic graph with n vertices, using this coloring algorithm, we get an edge 3-coloring with at most n/3 error vertices. In the second part, we study Jim Propp's Rotor-Router model on some non-bipartite graph. We find the difference …
-
Graph-Based Machine Learning for Passive Network Reconnaissance within Encrypted Networks
… network conditions. In contrast, we devise a bipartite graph-based representation to create network reconnaissance solutions that rely only on a single feature (e.g., the Internet protocol (IP) address field). We exploit a widely available feature set to provide network reconnaissance …
-
Out-of-Bag Stability for the Assessment and Combination of Clusters
… methods. Finally, this dissertation develops bipartite graph representations for integrated clustering solutions (meta-clustering) that leverage Smin-delta and community detection. Out-of-bag stability is extensively benchmarked using simulation and real data and shows promising performance …
-
Harnessing NLP and Large Language Models for Pattern Discovery and Information Extraction in Electric Health Reports
… drug mechanisms of action. 2. Heterogeneous Graph Neural Network for Gene-Chemical Entity Relation Extraction: We created a supervised deep learning model that adapts a heterogeneous Graph Neural Network to extract gene-chemical components. This model augments word representations using …
-
Construction of low density parity check codes without short cycles
… being 0.5. The effect of short cycles in the bipartite graph of regular LDPC codes has been considered. The simulation results show that the BER performances of regular H matrices that do not include short cycles of length four based on BPSK or 8PSK on AWGN channel is better than those of …
-
Graph Neural Networks for Bipartite Graphs
Bipartite graphs are a special type of graph data structure where vertices can be divided into two disjoint and independent sets, and each edge connects a vertex from one set to a vertex in the other set. They can be used to model many real-world applications such as user-item interaction networks, …
-
Coloring of Metric Spaces and L(2,1)-Labeling of Graphs
… = q 2 + q = Delta2 - Delta for the incidence graph G of the projective plane PG (2, q). To prove this result, we convert the problem to a problem of packing of bipartite graphs into a complete bipartite graph. We also bound lambda(G) when G is the Kneser graph K(2k + 1, k).
-
On Gallai-Ramsey Numbers of Complete Bipartite Graphs
… vertices necessary of a complete Gallai-colored graph on $k$ colors that forces a monochromatic complete bipartite graph $K_{2,m}$, $K_{3,3}$, and $K_{3,m}$, for $m\geq 3$. We also provide some results on graphs that are free of rainbow triangles with a pendant edge that provide more insight to …
-
Correspondence Colouring and its Applications to List Colouring and Delay Colouring
… a result by Georgakopoulos, stating that cubic graphs are 4-delay colourable. We show that delay colouring can be formulated as an instance of correspondence colouring. Then we show that the modified line graph of a cubic bipartite graph is generally 4-correspondence colourable, using a Brooks’ …
-
Some Problems in Structural Graph Theory
For a complete bipartite graph Ks,t, the total number of edges st may not be a triangular number; that is, there may exist 0 < ℓ ≤ n such that e(G) = 1 + 2 + 3 + ··· + n + ℓ. A new question is, can we still decompose the graph Ks,t into distinct paths of lengths 1, …
Page 1 of 11