Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering

DOI10.1137/S0895480102396099zbMath1068.05065OpenAlexW2076900610WikidataQ56288390 ScholiaQ56288390MaRDI QIDQ4652636

Sarnath Ramnath

Publication date: 28 February 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480102396099

zbMATH Keywords

semionline algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (2)

A multistage view on 2-satisfiability ⋮ Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints

This page was built for publication: Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering