Maximum Matchings via Algebraic Methods for Beginners
نویسنده
چکیده
This is an introduction to algebraic methods for calculating maximum matchings.
منابع مشابه
Algebraic Algorithms for Matching
Given a set of nodes and edges between them, what’s the maximum of number of disjoint edges? This problem is known as the graph matching problem, and its study has had an enormous impact on the develpoment of algorithms, combinatorics, optimization theory, and even complexity theory. Mathematicians have been interested in the matching problem since the 19th century, leading to celebrated theore...
متن کاملThe number of maximum matchings in a tree
We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) [Formula: see text] of a tree T of given order. While the trees that attain the lower bound are easily characterised, the trees with the largest number of maximum matchings show a very subtle structure. We give a complete characterisation of these trees and derive that the number of ...
متن کاملMaximum Matchings in Planar Graphs via Gaussian Elimination 1
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(n'~ where co is the exponent of the best known matrix multiplication algorithm. Since co < 2.38, this algorithm breaks through the O (n J.5) barrier for the matching problem. This is the first result of this kind for general planar graphs. We also present an algorithm lor generating perfect matchings in p...
متن کاملLayered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach
Using an algebra of paths we present abstract algebraic derivations for two problem classes concerning graphs, viz. layer oriented traversal and computing sets of Hamiltonian paths. In the rst case, we are even able to abstract to the very general setting of Kleene algebras. Applications include reachability and a shortest path problem as well as topological sorting, cycle detection and nding m...
متن کاملMaximum matchings in scale-free networks with identical degree distribution
The size and number of maximum matchings in a network have found a large variety of applications in many fields. As a ubiquitous property of diverse real systems, power-law degree distribution was shown to have a profound influence on size of maximum matchings in scale-free networks, where the size of maximum matchings is small and a perfect matching often does not exist. In this paper, we stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009