Flow Metrics on Graphs

Lior Kalman, Robert Krauthgamer

Type: Preprint

Publication Date: 2021-01-01

Citations: 1

DOI: https://doi.org/10.48550/arxiv.2112.06916

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Faster Sparse Minimum Cost Flow by Electrical Flow Localization	2022	Kyriakos Axiotis Aleksander Mądry Adrian Vladu
+	Faster Sparse Minimum Cost Flow by Electrical Flow Localization	2021	Kyriakos Axiotis Aleksander Mądry Adrian Vladu
+	Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows	2021	Monika Henzinger Billy Jin Richard Peng David P. Williamson
+	Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows	2021	Monika Henzinger Billy Jin Richard Peng David P. Williamson
+	An Enumerative Perspective on Connectivity	2023	Shyan Akmal
+	Almost-linear-time Weighted $\ell_p$-norm Solvers in Slightly Dense Graphs via Sparsification	2021	Deeksha Adil Brian Bullins Rasmus Kyng Sushant Sachdeva
+	Almost-Linear-Time Weighted 𝓁 p -Norm Solvers in Slightly Dense Graphs via Sparsification.	2021	Deeksha Adil Brian Bullins Rasmus Kyng Sushant Sachdeva
+	Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs	2020	Kyriakos Axiotis Aleksander Mądry Adrian Vladu
+	Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs	2020	Kyriakos Axiotis Aleksander Ma̧dry Adrian Vladu
+	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time	2022	Li Chen Rasmus Kyng Yang P. Liu Richard Peng Maximilian Probst Gutenberg Sushant Sachdeva
+ PDF Chat	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time	2022	Li Chen Rasmus Kyng Yang P. Liu Richard Peng Maximilian Probst Gutenberg Sushant Sachdeva
+ PDF Chat	An Enumerative Perspective on Connectivity	2024	Shyan Akmal
+	A survey on flows in graphs and matroids	2015	Bertrand Guenin
+ PDF Chat	Attacking Shortest Paths by Cutting Edges	2023	Benjamin A. Miller Zohair Shafi Wheeler Ruml Yevgeniy Vorobeychik Tina Eliassi‐Rad Scott Alfeld
+	Vertex Connectivity in Poly-logarithmic Max-flows	2021	Jason Li Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak Sorrachai Yingchareonthawornchai
+	Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs	2011	Paul F. Christiano Jonathan A. Kelner Aleksander Mądry Daniel A. Spielman Shang‐Hua Teng
+ PDF Chat	Faster <i>p</i>-norm minimizing flows, via smoothed <i>q</i>-norm problems	2019	Deeksha Adil Sushant Sachdeva
+	Reduction of Potential-Based Flow Networks	2023	Max Klimm Marc E. Pfetsch Rico Raber Martin Skutella
+	Optimal Transport and Minimal Trade Problem, Impacts on Relational Metrics and Applications to Large Graphs and Networks Modular	2013	Jean-François Marcotorchino
+	Edge-connectivity matrices and their spectra	2021	Tobias Hofmann Uwe Schwerdtfeger

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors