scientific article; zbMATH DE number 4049076

MaRDI QIDQ3785965zbMATH OpenFDO

Authors Fan Chung, Ron Graham, Michael Saks

Publication date 1987

zbMATH Keywords

diametersgraph searchingisometric embeddinglinear programmingretractsself-adjusting data structuresSteiner points

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2102754
• The complexity of searching a graph
• scientific article; zbMATH DE number 3900809
• scientific article; zbMATH DE number 4012654
• Amortized efficiency of a path retrieval data structure

Cited in

(20)

• Cube intersection concepts in median graphs
• Amortized efficiency of a path retrieval data structure
• An on-line graph coloring algorithm with sublinear performance ratio
• A new fixed point approach for stable networks and stable marriages
• Recognizing median graphs in subquadratic time
• On the natural imprint function of a graph
• Clique-gated graphs
• The majority strategy on graphs
• Quasi-median graphs, their generalizations, and tree-like equalities
• Semi-dynamic breadth-first search in digraphs
• On median nature and enumerative properties of Fibonacci-like cubes
• Peripheral convex expansions of resonance graphs
• Graph Searching in a Crime Wave
• Quasi‐median graphs and algebras
• scientific article; zbMATH DE number 1950680 (Why is no real title available?)
• Efficient search in graph databases using cross filtering
• Dynamic resource location with tropical algebra
• A dynamic location problem for graphs
• Dynamic location problems with limited look-ahead
• Cost thresholds for dynamic resource location

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3785965)