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 235 for “"bipartite"”.
-
Variations of online bipartite matching
The Online Bipartite Matching Problem is a well-studied problem in theoretical computer science that models several real-world applications including online investment, kidney transplantation, aviation security passenger screening, and enhanced Ebola entry screening. However, the original version …
-
Bipartite Density of Generalized Petersen Graphs
The bipartite density b(G) of a graph G with m edges is the maximum ratio [special characters omitted] where m0 is the number of edges in a bipartitesubgraph of G. In this study we determine the bipartite density of several classes of Generalized Petersen Graphs. These graphs are denoted by P(n, …
-
Entanglement in a Bipartite Gaussian State
To examine the loss of entanglement in a two-particle Gaussian system, we couple it to an environment and use the Non-Rotating Wave master equation to study the system's dynamics. We also present a derivation of this equation. We consider two di�fferent types of evolution. Under free evolution we …
-
Efficient algorithms for bipartite matching problems with preferences
… over one another. This thesis focuses on bipartite matching problems in which there are two disjoint sets of participants (such as medical students and hospitals). We present a range of efficient algorithms for finding various types of optimal matchings in the context of these problems. …
-
Spectral analysis in bipartite biregular graphs and community detection
… con- tributions. First, we prove that almost all bipartite biregular graphs are almost Ramanujan by providing a tight upper bound for the non trivial eigenvalues of its adjacency operator, proving Alon's Conjecture for this family of graphs. Secondly, we use a spectral algorithm to recover hidden …
-
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 …
-
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 …
-
Warm Start Algorithms for Bipartite Matching and Optimal Transport
Minimum Cost Bipartite Matching and Optimal Transport are essential optimization challenges with applications in logistics, artificial intelligence, and multimodal data alignment. These problems involve finding efficient pairings while minimizing costs. Due to the combinatorial nature of …
-
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 H<sub>i</sub> …
-
A Study of the Bipartite Ranking Problem in Machine Learning
… we demonstrate a practical application of bipartite ranking to a problem in bioinformatics, namely the problem of identifying genes related to a given disease based on microarray data. Our studies on leukemia and colon cancer data sets show very promising results, including the …
-
Spatiotemporal random bipartite matching problems and applications in mobility systems
… presents new findings on a variant of bipartite matching problem, referred to as the Spatiotemporal Random Bipartite Matching Problem (ST-RBMP), which accommodates randomness and heterogeneity in the spatial distribution and temporal arrival of bipartite vertices. This fundamental …
-
Efficient Decentralized Multi-Agent Learning in Asymmetric Bipartite Queuing Systems
We study decentralized multi-agent learning in bipartite queuing systems, a standard model for service systems. In particular, 𝑁 agents request service from 𝐾 servers in a fully decentralized way, i.e, by running the same algorithm without communication. Previous decentralized algorithms are …
-
Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm
… In this thesis, we consider the online bipartite matching problem where each server can serve exactly one request. In the online minimum metric bipartite matching problem, we are provided with a set of server locations in a metric space. Requests arrive one at a time that have to be …
-
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 …
-
Properties of the Toric Rings of a Chordal Bipartite Family of Graphs
… coming from the toric ideals of a chordal bipartite infinite family of graphs (alternately, these rings may be interpreted as coming from determinants of certain ladder-like structures). We determine a linear system of parameters for each ring and explicitly determine the Hilbert series for …
-
A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs
… interest to us being the Maximum Cardinality Bipartite Matching in Planar Graphs. In this work, we present a novel sparsification based approach for computing maximum/perfect bipartite matching in planar graphs. The overall complexity of our algorithm is O(n<sup>6/5</sup> log² n) where n is …
-
Empirical Analysis of Algorithms for the k-Server and Online Bipartite Matching Problems
… APPROX 2016] for the closely related online bipartite matching problem. We then give a comprehensive experimental analysis of this algorithm and also provide a graphical user interface which can be used to visualize execution instances of the algorithm. We also consider these problems under …
-
Bipartite Assertion: A New Account of Assertion, Defined in Terms of Responsibility and Explicit Presentation
… work of Robert Brandom in order to give a new bipartite theory of assertion. I argue that assertion consists in the explicit presentation of a proposition, along with a taking of responsibility for that proposition. Taking Alston's explicit presentation condition and repairing it in order to …
Page 1 of 12