Recommendations
Cites work
- n‐cubes and median graphs
- Amortized Computational Complexity
- An optimal on-line algorithm for metrical task system
- Distance-preserving subgraphs of hypercubes
- Fixed-edge theorem for graphs with loops
- Graphs Orientable as Distributive Lattices
- Heuristics That Dynamically Organize Data Structures
- scientific article; zbMATH DE number 3882485 (Why is no real title available?)
- scientific article; zbMATH DE number 4049076 (Why is no real title available?)
- scientific article; zbMATH DE number 3697144 (Why is no real title available?)
- scientific article; zbMATH DE number 3717345 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3572835 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3245176 (Why is no real title available?)
- scientific article; zbMATH DE number 3395950 (Why is no real title available?)
- Infinite median graphs, (0, 2)-graphs, and hypercubes
- Join-semilattices and simple graphic algebras
- Median algebras
- Median graphs and Helly hypergraphs
- Metric Ternary Distributive Semi-Lattices
- On a class of isometric subgraphs of a graph
- On Isometric Embeddings of Graphs
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
- On self-organizing sequential search heuristics
- On Serial Files with Relocatable Records
- On the Addressing Problem for Loop Switching
- Optimal list order under partial memory constraints
- Pursuit—Evasion games on graphs
- Self-organizing sequential search and Hilbert's inequalities
- The smallest graph variety containing all paths
- Vertex-to-vertex pursuit in a graph
Cited in
(28)- An on-line graph coloring algorithm with sublinear performance ratio
- A Helly theorem in weakly modular space
- Invariant Hamming graphs in infinite quasi-median graphs
- A competitive analysis of the list update problem with lookahead
- The retracts of Hamming graphs
- A new fixed point approach for stable networks and stable marriages
- Recognizing median graphs in subquadratic time
- Coloring inductive graphs on-line
- Lower bounds for on-line graph coloring
- On the natural imprint function of a graph
- Clique-gated graphs
- Retracts of infinite Hamming graphs
- Quasi-median graphs, their generalizations, and tree-like equalities
- Decomposition and \(l_1\)-embedding of weakly median graphs
- Generalized Hamming graphs: some new results
- Cartesian products of block graphs
- The algebra of metric betweenness. I: Subdirect representation and retraction
- Tree-like partial Hamming graphs
- An ABC-problem for location and consensus functions on graphs
- scientific article; zbMATH DE number 714106 (Why is no real title available?)
- scientific article; zbMATH DE number 1985668 (Why is no real title available?)
- Skeletons, recognition algorithm and distance matrix of quasi-median graphs
- A competitive analysis of the list update problem with lookahead
- Parametrized relocation of low-mobility resources
- Dynamic resource location with tropical algebra
- Dynamic location problems with limited look-ahead
- Hamming polynomials and their partial derivatives
- Cost thresholds for dynamic resource location
This page was built for publication: A dynamic location problem for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583245)
