Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings
From MaRDI portal
Publication:266919
DOI10.1016/j.dam.2015.11.016zbMath1333.05236OpenAlexW2181759657MaRDI QIDQ266919
Ichiro Suzuki, Christine T. Cheng, Eric J. McDermid
Publication date: 7 April 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.11.016
Combinatorics of partially ordered sets (06A07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Modular lattices, complemented lattices (06C99)
Related Items (2)
Constructing almost peripheral and almost self-centered graphs revisited ⋮ Constructing uniform central graphs and embedding into them
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Every finite distributive lattice is a set of stable matchings
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- Distance center and centroid of a median graph
- Generating random elements of finite distributive lattices
- Lattice structures from planar graphs
- Understanding the generalized median stable matchings
- Efficient determination of the transitive closure of a directed graph
- Rings of sets
- All-pairs shortest paths for unweighted undirected graphs in o(mn) time
- The Complexity of Counting Stable Marriages
- Three Fast Algorithms for Four Problems in Stable Marriage
- Multiplying matrices faster than coppersmith-winograd
- Algorithms – ESA 2004
- Fast approximation algorithms for the diameter and radius of sparse graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- College Admissions and the Stability of Marriage
- Diameter determination on restricted graph families
This page was built for publication: Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings
