A new fixed point approach for stable networks and stable marriages
type: Item
instance of: scholarly article
title: A new fixed point approach for stable networks and stable marriages
zbMATH Open document ID: 0772.68052
DOI: 10.1016/0022-0000(92)90048-N
author: Tomás Feder
published in: Journal of Computer and System Sciences
publication date: 1993-01-17T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 97377
zbMATH Keywords: network stability
zbMATH Keywords: restricted fanout
zbMATH Keywords: retracts
zbMATH Keywords: isometric embeddings
zbMATH Keywords: product graphs
zbMATH Keywords: stable matching
MaRDI profile type: Publication
cites work: Improved Time Bounds for the Maximum Flow Problem
cites work: Retracts of hypercubes
cites work: A fixed cube theorem for median graphs
cites work: A linear-time approximation algorithm for the weighted vertex cover problem
cites work: Q3785965
cites work: A dynamic location problem for graphs
cites work: A decomposition theorem for partially ordered sets
cites work: Product graph representations
cites work: College Admissions and the Stability of Marriage
cites work: Finding Minimum-Cost Circulations by Successive Approximation
cites work: On Isometric Embeddings of Graphs
cites work: Three Fast Algorithms for Four Problems in Stable Marriage
cites work: The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
cites work: Q3995616
cites work: Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
cites work: Equivalent approximation algorithms for node cover
cites work: A bounded approximation for the minimum cost 2-sat problem
cites work: Absolute Retracts and Varieties of Reflexive Graphs
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: An efficient algorithm for the “stable roommates” problem
cites work: The Complexity of Counting Stable Marriages
cites work: Q4130997
cites work: n‐cubes and median graphs
cites work: Vertex packings: Structural properties and algorithms
cites work: Retract rigid Cartesian products of graphs
cites work: Q3768905
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: A New Approach to Stable Matching Problems
cites work: Depth-First Search and Linear Graph Algorithms
cites work: On connectivity of triangulations of manifolds
full work available at URL: 0022-0000(92)90048-n
OpenAlex ID: W2952126919
description: scientific article; zbMATH DE number 97377