Stable marriage problemIn mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element. A matching is a bijection from the elements of one set to the elements of the other set. A matching is not stable if: In other words, a matching is stable when there does not exist any pair (A, B) which both prefer each other to their current partner under the matching.
Matching (graph theory)In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In other words, a subset of the edges is a matching if each vertex appears in at most one edge of that matching. Finding a matching in a bipartite graph can be treated as a network flow problem. Given a graph G = (V, E), a matching M in G is a set of pairwise non-adjacent edges, none of which are loops; that is, no two edges share common vertices.
Fractional matchingIn graph theory, a fractional matching is a generalization of a matching in which, intuitively, each vertex may be broken into fractions that are matched to different neighbor vertices. Given a graph G = (V, E), a fractional matching in G is a function that assigns, to each edge e in E, a fraction f(e) in [0, 1], such that for every vertex v in V, the sum of fractions of edges adjacent to v is at most 1: A matching in the traditional sense is a special case of a fractional matching, in which the fraction of every edge is either 0 or 1: f(e) = 1 if e is in the matching, and f(e) = 0 if it is not.
Maximum cardinality matchingMaximum cardinality matching is a fundamental problem in graph theory. We are given a graph G, and the goal is to find a matching containing as many edges as possible; that is, a maximum cardinality subset of the edges such that each vertex is adjacent to at most one edge of the subset. As each edge will cover exactly two vertices, this problem is equivalent to the task of finding a matching that covers as many vertices as possible.
Maximum weight matchingIn computer science and graph theory, the maximum weight matching problem is the problem of finding, in a weighted graph, a matching in which the sum of weights is maximized. A special case of it is the assignment problem, in which the input is restricted to be a bipartite graph, and the matching constrained to be have cardinality that of the smaller of the two partitions. Another special case is the problem of finding a maximum cardinality matching on an unweighted graph: this corresponds to the case where all edge weights are the same.
MarriageMarriage, also called matrimony or wedlock, is a culturally and often legally recognized union between people called spouses. It establishes rights and obligations between them, as well as between them and their children (if any), and between them and their in-laws. It is nearly a cultural universal, but the definition of marriage varies between cultures and religions, and over time. Typically, it is an institution in which interpersonal relationships, usually sexual, are acknowledged or sanctioned.
Greedy algorithmA greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy strategy does not produce an optimal solution, but a greedy heuristic can yield locally optimal solutions that approximate a globally optimal solution in a reasonable amount of time. For example, a greedy strategy for the travelling salesman problem (which is of high computational complexity) is the following heuristic: "At each step of the journey, visit the nearest unvisited city.
Civil marriageA civil marriage is a marriage performed, recorded, and recognized by a government official. Such a marriage may be performed by a religious body and recognized by the state, or it may be entirely secular. Every country maintaining a population registry of its residents keeps track of marital status, and all UN Member countries except Iran, Somalia, South Sudan, Sudan, and Tonga have signed or ratified either the United Nations Convention on Consent to Marriage, Minimum Age for Marriage, and Registration of Marriages (1962) or the United Nations Convention on the Elimination of All Forms of Discrimination against Women (1979) which carry a responsibility to register marriages.
Perfect matchingIn graph theory, a perfect matching in a graph is a matching that covers every vertex of the graph. More formally, given a graph G = (V, E), a perfect matching in G is a subset M of edge set E, such that every vertex in the vertex set V is adjacent to exactly one edge in M. A perfect matching is also called a 1-factor; see Graph factorization for an explanation of this term. In some literature, the term complete matching is used. Every perfect matching is a maximum-cardinality matching, but the opposite is not true.
Child marriageChild marriage is a marriage, similar union, formal or informal, between a child under a certain age – typically 18 years – and an adult or another child. The vast majority of child marriages are between a female child and a male adult, and are rooted in gender inequality. Although the age of majority (legal adulthood) and marriageable age are usually designated at age 18, both vary across countries, and therefore the marriageable age may be older or younger in a given country.
Open marriageOpen marriage is a form of non-monogamy in which the partners of a dyadic marriage agree that each may engage in extramarital sexual relationships, without this being regarded by them as infidelity, and consider or establish an open relationship despite the implied monogamy of marriage. There are variant forms of open marriage such as swinging and polyamory, each with the partners having varying levels of input into their spouse's activities.
Common-law marriageCommon-law marriage, also known as non-ceremonial marriage, sui iuris marriage, informal marriage, de facto marriage, or marriage by habit and repute. In the jurisdictions where marriage can still be contracted this way, a common law marriage is a legal marriage despite non-compliance with the requirements for a statutory marriage. The original concept of a "common-law marriage" is one considered valid by both partners, but not formally recorded with a state or religious registry, nor celebrated in a formal civil or religious service.
Christian views on marriageFrom the earliest days of the Christian faith, Christians have viewed marriage as a divinely blessed, lifelong, monogamous union between a man and a woman. However, while many Christians might agree with the traditional definition, the terminology and theological views of marriage have varied through time in different countries, and among Christian denominations. Many Protestants consider marriage to be a sacred institution or "holy ordinance" of God. Catholic and Eastern Orthodox Christians consider marriage as a holy sacrament or sacred mystery.
Kruskal's algorithmKruskal's algorithm (also known as Kruskal's method) finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree. (A minimum spanning tree of a connected graph is a subset of the edges that forms a tree that includes every vertex, where the sum of the weights of all the edges in the tree is minimized. For a disconnected graph, a minimum spanning forest is composed of a minimum spanning tree for each connected component.
