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 214 for “"Bipartite Graphs"”.
-
Restricted 2-factors in bipartite graphs
… and polyhedral conditions for 2-factors in bipartite graphs and restricted 2-factors in bipartite graphs. We introduce a generalization of the necessary and sufficient condition for 4-restricted 2-factors in bipartite graphs to 2k-restricted 2-factors in bipartite graphs of a particular form.
-
Colored Saturation Parameters for Bipartite Graphs
Let F and H be fixed graphs and let G be a spanning subgraph of H. G is an F-free subgraph of H if F is not a subgraph of G. We say that G is an F-saturated subgraph of H if G is F-free and for any edge e in E(H)-E(G), F is a subgraph of G+e. The saturation number of F in K_{n,n}, denoted …
-
Star bi-coloring of bipartite graphs
Evaluation of the Jacobian is the most computationally expensive operation while solving a non-linear system. Knowledge of the sparsity pattern in advance reduces the computational cost. Bi-directional partitioning to determine non-zeroes in the sparse matrix works better than unidirectional …
-
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, …
-
Cospectral bipartite graphs for the normalized Laplacian
… Laplacian to find cospectral pairs of unweighted bipartite graphs with respect to the normalized Laplacian. We show that almost all trees are cospectral with respect to the normalized Laplacian. Further, we show that almost all trees are cospectral with respect to the generalized characteristic …
-
Efficient Community Search on Large Bipartite Graphs
In many real-world applications, bipartite graphs are naturally used to model relationships between two types of entities. Community discovery over bipartite graphs is a fundamental problem and has attracted much attention recently. However, all existing studies overlook the weight (e.g., influence …
-
Efficient Cohesive Subgraph Computation on Bipartite Graphs
Bipartite graphs are widely used to model interactions between two disjoint sets of entities, such as user–item systems and author–paper networks. Cohesive subgraph computation in bipartite graphs is fundamental in graph analytics, as cohesive structures provide insights for community discovery, …
-
Applications of the Combinatorial Nullstellensatz on bipartite graphs.
… Nullstellensatz to finding perfect matchings in bipartite graphs. The first two chapters provide background material covering topics such as linear algebra, group theory, graph theory and even the discrete Fourier transform. New results start in the third chapter, showing that the Combinatorial …
-
On Gallai-Ramsey Numbers of Complete Bipartite Graphs
… $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 the structure of Gallai colorings.
-
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 …
-
Efficient computation of cohesive subgraphs on bipartite graphs
A bipartite graph is a graph with two layers such that vertices in the same layer are not connected, which is widely used to model the relationships among two types of entities. Examples of bipartite graphs include author-paper networks, customer-product networks, and ecological networks (e.g., the …
-
Comparing invariants of toric ideals of bipartite graphs
… related to combinatorial objects, in this case, graphs, a deeper investigation can be conducted. If, in addition, the graph G is bipartite, even more can be said about these invariants. In this thesis, we explore a comparison of invariants of toric ideals of bipartite graphs. Our main result …
-
Visual medical decision-making: Bipartite graphs vs. interactive tables.
Most of the current medical diagnosis support systems are based on a textual design. In this thesis we present a model that uses a different design. It uses visualization to aid home diagnosis of common diseases in a user-friendly way. The model clearly displays the diagnostic results on the …
-
Efficient Computation of Cohesive Subgraphs in Uncertain Bipartite Graphs
Bipartite graphs are extensively used to model relationships between two different types of entities. In many real-world bipartite graphs, relationships are naturally uncertain due to various reasons such as data noise, measurement error and imprecision of data, leading to uncertain bipartite …
-
Scalable Propagation Algorithms for Node Labeling in Bipartite Graphs
Bipartite graphs are graphs whose vertices can be partitioned into 2 different independent sets. Many interesting machine learning problems either present themselves naturally as problems of node labeling in bipartite graphs (like user modeling in social networks) or can be converted into this form …
-
On the isomorphism problem for a class of bipartite graphs
… graph isomorphism problem for a special class of graphs. Each graph is characterized by its edge set, and a subgroup of its automorphism group, called the colour group. In particular, a simple, efficient algorithm for determining whether two graphs are isomorphic if at least one is a member of 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 …
-
Restricted and Unrestricted Coverings of Complete Bipartite Graphs with Hexagons
… conditions for minimal coverings of complete bipartite graph with 6-cycles, which we call minimal unrestricted coverings. We also give necessary and sufficient conditions for minimal coverings of the complete bipartite graph with 6-cycles with the added condition the edge set of Hi is a subset …
Page 1 of 11