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 50 for “"Matchings"”.
-
Matchings, matroids and submodular functions
… for constructing perfect or maximum cardinality matchings in non-bipartite graphs. Our algorithm requires O(n") time in graphs with n vertices, where w < 2.38 is the matrix multiplication exponent. This algorithm achieves the best-known running time for dense graphs, and it resolves an open …
-
On matchings and factors of graphs /
In Section 1, we recall the historical sketch of matching and factor theory of graphs, and also introduce some necessary definitions and notation. In Section 2, we present a sufficient condition for the existence of a (g, f)-factor in graphs with the odd-cycle property, which is simpler than that …
-
Circuits, Perfect Matchings and Paths in Graphs
We primarily consider the problem of finding a family of circuits to cover a bidgeless graph (mainly on cubic graph) with respect to a given weight function defined on the edge set. The first chapter of this thesis is going to cover all basic concepts and notations will be used and a survey of this …
-
Matchings, Connectivity, and Eigenvalues in Regular Graphs
… edge-connectivity, and the number of perfect matchings. In Chapter 5, we study an $r$-dynamic coloring problem and give the relationship between the $r$-dynamic chromatic number and the chromatic number in regular graphs. We also study $r$-dynichromatic number of the cartesian product of paths …
-
SUBLINEAR GRAPH SPARSIFICATION WITH APPLICATIONS TO CUTS, MATCHINGS, AND FLOWS
… sparsification, hierarchical clustering, maximum matchings, maximum flows, and minimum cuts. A common and unifying theme underlying these problems is {\em graph sparsification}, a powerful tool that significantly reduces the size of the graph while preserving some fundamental properties of the …
-
Sparse color-critical graphs and rainbow matchings in edge-colored graphs
Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-04-05T19:14:32Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 26 THESIS_04.tex: 303472 bytes, checksum: ac02fb44aef43edf6047cfd6a308c01b (MD5) Setup.pdf: 26974 bytes, checksum: …
-
Efficient algorithms for bipartite matching problems with preferences
… algorithms for finding various types of optimal matchings in the context of these problems. Our optimality criteria involve a diverse range of concepts that are alternatives to classical stability. Examples include so-called popular and Pareto optimal matchings, and also matchings that are …
-
Algorithmic issues in queueing systems and combinatorial counting problems
… are for special cases of counting the number of matchings, colorings, or perfect matchings (permanent), of a graph.
-
A Holistic Paradigm for Large Scale Schema Matching
… match many schemas at the same time and find all matchings at once. By handling a set of schemas together, we can explore their context information that reflects the semantic correspondences among attributes. Such information is not available when schemas are matched only in pairs. As the …
-
Local computation algorithms for graphs of non-constant degrees
… for computing maximal independent sets, maximal matchings, and approximate maximum matchings. Both time and space complexities of our LCAs on these problems are 2 0(log3 d)polylog(n), 2 0(log2 d)polylog(n) and 2 0(log3 d)polylog(n), respectively.
-
Algorithms for Vertex-Weighted Matching in Graphs
… sparse linear systems of equations, where matchings are used to place large matrix elements on or close to the diagonal, to compute the block triangular decomposition of sparse matrices, to construct sparse bases for the null space or column space of under-determined matrices, and to …
-
Four Problems in Probability and Optimization
… $S_n$-irreducible decomposition of the space of matchings on $K_n$ as given by Barbasch and Vogan. We give an explicit map of the isomorphism in their result. We also generalize their approach to matchings on hypergraphs.
-
Algebraic methods in graph theory
… graphs. Finally, we compute the extendability of matchings for many strongly regular graphs and many distance-regular graphs.
-
Interval order enumeration
… to introduce a previously unconsidered class of matchings; explicitly, zero alignment matchings according to the number of arcs which are both right-crossed and left-nesting. The technique is then used to identify a statistic on the factorial posets of Claesson and Linusson (2011) following the …
-
Cluster algebras and discrete integrable systems
… are shown to be partition functions of perfect matchings, non-intersecting paths and networks. This also provides a solution to other systems with various choices of coefficients on T-systems including Speyer's octahedron recurrence (Speyer 2007), generalized lambda-determinants (Di Francesco …
-
Distributed learning in games under bounded rationality
… Utility (TU) coalitional games, (ii) TU B-matchings, and (iii) Non-Transferable Utility (NTU) B-matchings, we extend the classical core solution concept to each structure and design distributed dynamics in which agents rely only on local information and individual payoff aspirations. We …
-
Warm Start Algorithms for Bipartite Matching and Optimal Transport
… enables a faster computation of approximate matchings or transport plans with extremely small additive error (delta) faster than the original LMR algorithm, which currently holds the state-of-the-art execution time for approximating the optimal transport plan, a generalization of bipartite …
-
School choice : a discrete optimization approach
… techniques which only produce stable matchings that do not incorporate these different objectives; this can be expensive and inequitable. We present a new optimization model for the Stable Matching (SM) school choice problem which relies on an algorithm we call …
-
Property testing : theory and applications
… exist graphs with many edge-disjoint induced matchings of linear size. In the final part of the thesis, we initiate an investigation of property testing as applied to images. We study visual properties of discretized images represented by n x n matrices of binary pixel values. We obtain …
-
Web service for 19th century Irish personal name matching
… from using inheritance. The system performs matchings on large quantities of names in a reasonable time. We test our system with 12,944 name matchings and the result were completed in no more than half a minute (28,786 milliseconds, to be precise). However, the system consumes a large amount …
Page 1 of 3