Median decompositions arise from any system of vertex cuts via Sageev's dual median graph, are uniquely minimal, satisfy median-width equals clique number on all graphs, and characterize proper geometric actions of groups on median graphs through canonical decompositions of Cayley graphs.
Graph Minors
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.
citing papers explorer
-
Vertex cuts and median decompositions
Median decompositions arise from any system of vertex cuts via Sageev's dual median graph, are uniquely minimal, satisfy median-width equals clique number on all graphs, and characterize proper geometric actions of groups on median graphs through canonical decompositions of Cayley graphs.
-
The price of incrementality in k-center clustering
Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.