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 48 for “"bipartite graph"”.
-
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 …
-
Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants
The one-sided bipartite graph drawing problem has been extensively studied in the graph drawing literature, with numerous papers appearing over the years showing novel algorithms and heuristics for minimizing associated edge crossings. Although stochastic methods have been highly successful when …
-
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 …
-
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 …
-
Restricted and Unrestricted Coverings of Complete Bipartite Graphs with Hexagons
<p>A minimal covering of a graph G with isomorphic copies of graph H is a set {H<sub>1</sub>, H<sub>2</sub>, H<sub>3</sub>, ... , H<sub>n</sub>} where H<sub>i</sub> is isomorphic to H, the vertex set of H<sub>i</sub> is a subset of G, the edge set of G is a subset of the union of H<sub>i</sub>'s, …
-
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).
-
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, …
-
Competitive algorithms for online matching and vertex cover problems
… witnessed an explosion of research on the online bipartite matching problem. Surprisingly, its dual problem, online bipartite vertex cover, has never been explicitly studied before. One of the motivation for studying this problem is that it significantly generalizes the classical ski rental …
-
Robust Exact Algorithms for the Euclidean Bipartite Matching Problem
The minimum cost bipartite matching problem is a well-studied optimization problem in computer science and operations research, with wide-ranging applications in fields such as machine learning, economics, transportation, logistics and biology. A special instance of this problem is the computation …
-
Extremal Problems in Graph Theory: Hamiltonicity, Minimum Vertex -Diameter -2 -Critical Graphs and Decomposition
A star, K1,s, is the complete bipartite graph whose partite sets have size 1 and s, respectively. A graph G has the t-star property if every t vertices of G belong to a subgraph which is a star. Erdo&huml;s, Sauer, Schaer, and Spencer [ESSS] defined f(t, k) to be the minimum n such that the …
-
Physical redundancy for defect tolerance : example designs and fundamental limits
… redundancy which are modeled abstractly as a bipartite graph. The goal is to determine the characteristics of graph structures which optimize the trade-off between the number of edges and the number of redundant components or nodes needed while correcting a deterministic number of worst-case …
-
Signal representations: from images to irregular-domain signals
… signals including images and signals on general graphs. The first half of the thesis deals with two different classes of images that can be considered as signals living on regular grid graph. For the first class of cartoon-like images, which are piecewise smooth away from smooth edges, the …
-
A Graph Convolutional Network approach for enhancing Set Covering Problem solvers
… for large instances. This study proposes a Graph Convolutional Network (GCN) to approximate optimal solutions for SCP. A bipartite graph representation of SCP is employed to predict node priority, serving as a warm start for the Gurobi solver. The GCN is trained on solutions from a classical …
-
Universal and succinct source coding of deep neural networks
… than naive approaches is recognizing that the bipartite graph layers of feedforward networks have a kind of permutation invariance to the labeling of nodes, in terms of inferential operation. We provide efficient algorithms to dissipate this irrelevant uncertainty and then use arithmetic coding …
-
ANALYSIS ON RETAILERS COLLABORATION IN SUPPLY NETWORKS
… are used for further analysis. Techniques in graph theory are applied to study the relationship among the retailers and the collaboration effects on them. We also explain how to use properties of a bipartite graph to gain better understanding on the retailer-customer relationship.
-
Network oblivious transfer
… In particular, we characterize which n-party OT graphs G allow t-secure computation of OT correlations between all pairs of parties, showing that this is possible if and only if the complement of G does not contain the complete bipartite graph K[subscript n-t,n-t] as a subgraph.
-
Computing Exact Bottleneck Distance on Random Point Sets
Given a complete bipartite graph on two sets of points containing n points each, in a bottleneck matching problem, we want to find an one-to-one correspondence, also called a matching, that minimizes the length of its largest edge; the length of an edge is simply the Euclidean distance between its …
-
The Configuration Space of Two Particles Moving on a Graph
… of two particles moving without collisions on a graph Γ with a view to calculating the Betti numbers of this space. We develop an intersection theory for cycles in graphs inspired by the classical intersection theory for cycles in manifolds and we use this to develop an algorithm to calculate the …
-
Decentralized Auction Solutions for Dynamic, Networked Markets
… through buyer--seller interactions on the bipartite graph representing participation, or the set of active bids, capturing the interdependencies between players within the network. We introduce a set of mixed strategies defined by probability distributions over these feasible actions, …
-
Approximation algorithms for packing and scheduling problems
… number of colors needed to color all edges of a bipartite graph equals the maximum vertex degree. For the weighted generalization, a longstanding open question is to determine the minimum number of colors as a function of n, the maximum total weight adjacent to any vertex. Our main contribution …
Page 1 of 3