Pages that link to "Item:Q2379917"
From MaRDI portal
The following pages link to Computing median and antimedian sets in median graphs (Q2379917):
Displaying 13 items.
- Computing the blocks of a quasi-median graph (Q477343) (← links)
- A poset-based approach to embedding median graphs in hypercubes and lattices (Q766140) (← links)
- On the remoteness function in median graphs (Q967439) (← links)
- Recognizing median graphs in subquadratic time (Q1285576) (← links)
- Median sets and median number of a graph (Q1935982) (← links)
- On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs (Q2001612) (← links)
- Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
- The median partition and submodularity (Q2245064) (← links)
- Axiomatic characterization of the median and antimedian function on a complete graph minus a matching (Q2357160) (← links)
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives (Q2428653) (← links)
- An algorithm finding p-medians of a graph (Q3748084) (← links)
- AXIOMATIC CHARACTERIZATION OF THE ANTIMEDIAN FUNCTION ON PATHS AND HYPERCUBES (Q4903640) (← links)
- On 2-Connected Transmission Irregular Graphs (Q4973227) (← links)