Directed metrics and directed graph partitioning problems

DOI10.1145/1109557.1109564zbMath1192.90219OpenAlexW4244376142MaRDI QIDQ3581572

Konstantin Makarychev, Makarychev Yury, Moses Charikar

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109564

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

On the directed cut cone and polytope ⋮ A generalized inverse for graphs with absorption ⋮ Unnamed Item ⋮ On tight spans for directed distances ⋮ On generalized discrete metric structures ⋮ Bipartitioning of directed and mixed random graphs ⋮ Unnamed Item ⋮ Quasimetric embeddings and their applications ⋮ Multicommodity flows and cuts in polymatroidal networks ⋮ A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities

This page was built for publication: Directed metrics and directed graph partitioning problems