science, the lattice of stable matchings is a distributive lattice whose elements are stable matchings. For a given instance of the stable matching problem...

relaxation of stable matching for many-to-one matching problems Rainbow matching for edge colored graphs Stable matching polytope Lattice of stable matchings Secretary...

stable matching problem. The stable matching polytope is the convex hull of the indicator vectors of the stable matchings of the given problem. It has a...

NJE matchings. The set of all NJE matchings is a lattice. The set of stable matchings (which are a subset of the NJE matchings) is a fixed point of a Tarsky...

This produces a matching that is best for all applicants and worst for all employers among all stable matchings. These two matchings are the top and bottom...

Gale and Lloyd Shapley finds a stable matching in their setting; moreover, the set of stable matchings forms a lattice, and similar vacancy chain dynamics...

super-stable matching else no strongly stable matching exists In many problems, there can be several different stable matchings. The set of stable matchings...

lattice of stable matchings, the Gale–Shapley algorithm for finding stable solutions, and two key properties of this algorithm: that among all stable...

nonempty set has a removable element. Lattice of stable matchings, also representing every finite distributive lattice Birkhoff (1937). Stanley (1997). Johnstone...

Equivalently, its vertices can be thought of as describing all perfect matchings in a complete bipartite graph, and a linear optimization problem on this...

by increased temperature or by presence of suitable atoms in the lattice which reduce the available number of 5f electrons and weaken their bonds. The...

can be also grown in a semi-insulating form, which is suitable as a lattice-matching insulating substrate for GaAs devices. Conversely, silicon is robust...

certain range of the lattice parameters. More accurate lattice parameters allow a narrower range and, thus, a better match. Lattice matching is useful in...

discovery. The change and sharpness of the electron backscatter patterns (EBSPs) provide information about lattice distortion in the diffracting volume...

Bloom filters being the case of the Boolean two-element lattice). Instead of a bit array, they have an array of lattice elements. When adding a new association...

these tiles can only exhibit a hierarchy of square lattices: the centre of any orange square is also a corner of a larger orange square, ad infinitum. Any...

The distributive polytopes all of whose vertex coordinates are 0 or 1 are exactly the order polytopes. Stable matching polytope, a convex polytope that...

can be emitted by using the process of sound amplification based on stimulated emission of phonons. Sound (or lattice vibration) can be described by a phonon...

is cooled, a lattice mismatch strain arises between TGO and the top coat (TC) due to differing thermal expansion coefficients. Lattice mismatch strain...

filters are electromechanical devices. BAW filters can implement ladder or lattice filters. BAW filters typically operate at frequencies from around 2 to...

many pores of uniform size because the boundary diffusion distance is smallest. during the latter portions of the process, boundary and lattice diffusion...

lattice, ytterbium crystallizes in the face-centered cubic system. Ytterbium has a density of 6.973 g/cm3, which is significantly lower than those of...

the nodes of a lattice and deforming the object with the lattice. However, explicit solutions to these systems are not very numerically stable and are extremely...

automaton consists of a regular grid of cells, each in one of a finite number of states, such as on and off (in contrast to a coupled map lattice). The grid can...

or continues with two kinds of periodicities of 8... Wilson, Robert A. (2009). "Octonions and the Leech lattice". Journal of Algebra. 322 (6): 2186–2190...

to tooth mineral is based on matching distances of Ca-ion binding sites on P11-4 and Ca spacing in the crystal lattice of hydroxyapatite. The matrix formation...

perfect 1-factorization is a partition of the edges of a graph into perfect matchings so that each two matchings form a Hamiltonian cycle. peripheral 1...

code, and an example of a stabilizer code, defined on a two-dimensional spin lattice. It is the simplest and most well studied of the quantum double models...

that is used in the generalized Gauss–Bonnet theorem. The number of perfect matchings in a planar graph is given by a Pfaffian, hence is polynomial time...

through graphene's honeycomb lattice effectively lose their mass, producing quasi-particles that are described by a 2D analogue of the Dirac equation rather...