Directed metrics and directed graph partitioning problems

DOI10.1145/1109557.1109564MaRDI QIDQ3581572zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(9)

• A generalized inverse for graphs with absorption
• Quasimetric embeddings and their applications
• On tight spans for directed distances
• On the directed cut cone and polytope
• A metric on directed graphs and Markov chains based on hitting probabilities
• A directed graph associated with a \(T_0\)-quasi-metric space
• Bipartitioning of directed and mixed random graphs
• Polyhedral structures associated with quasi-metrics
• On generalized discrete metric structures

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

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