A new fixed point approach for stable networks and stable marriages (Q1201153): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Improved Time Bounds for the Maximum Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retracts of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed cube theorem for median graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic location problem for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Product graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum-Cost Circulations by Successive Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isometric Embeddings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Fast Algorithms for Four Problems in Stable Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every finite distributive lattice is a set of stable matchings for a small stable marriage instance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent approximation algorithms for node cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounded approximation for the minimum cost 2-sat problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute Retracts and Varieties of Reflexive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the “stable roommates” problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Stable Marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>n</i>‐cubes and median graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retract rigid Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Stable Matching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On connectivity of triangulations of manifolds / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(92)90048-n / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2952126919 / rank
 
Normal rank

Latest revision as of 09:28, 30 July 2024

scientific article
Language Label Description Also known as
English
A new fixed point approach for stable networks and stable marriages
scientific article

    Statements

    A new fixed point approach for stable networks and stable marriages (English)
    0 references
    0 references
    17 January 1993
    0 references
    network stability
    0 references
    restricted fanout
    0 references
    retracts
    0 references
    isometric embeddings
    0 references
    product graphs
    0 references
    stable matching
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers