Stable networks and product graphs

DOI10.1090/memo/0555zbMath0875.68397OpenAlexW2085944695MaRDI QIDQ4841789

Tomás Feder

Publication date: 9 November 1997

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/memo/0555

zbMATH Keywords

isometric embeddingssatisfiabilitynonexpansive mappingsnetwork flowmedian graphsstable matchinggraph distanceretractsnetwork stability

Mathematics Subject Classification ID

Related Items (25)

Medians in median graphs and their cube complexes in linear time ⋮ The algebra of metric betweenness. I: Subdirect representation and retraction ⋮ Computing median and antimedian sets in median graphs ⋮ On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) ⋮ Constrained stable marriage with free edges or few blocking pairs ⋮ Strong edge geodetic problem in networks ⋮ On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets ⋮ On optimizing edge connectivity of product graphs ⋮ Understanding the generalized median stable matchings ⋮ Edge-coloring almost bipartite multigraphs ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ Some results on the lexicographic product of vertex-transitive graphs ⋮ Motion planning in Cartesian product graphs ⋮ Computing on structures ⋮ Study on specialist outpatient matching appointment and the balance matching model ⋮ On Boolean Automata Networks (de)Composition1 ⋮ Sex-equal stable matchings: complexity and exact algorithms ⋮ Retracts of Products of Chordal Graphs ⋮ Fanout limitations on constraint systems ⋮ Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations ⋮ Balanced stable marriage: how close is close enough? ⋮ The complexity of the comparator circuit value problem ⋮ A poset-based approach to embedding median graphs in hypercubes and lattices ⋮ On a simple randomized algorithm for finding a 2-factor in sparse graphs ⋮ Characterizing flag graphs and incuced subgraphs of Cartesian product graphs

This page was built for publication: Stable networks and product graphs