Min-cost-flow preserving bijection between subgraphs and orientations

by   Izhak Elmaleh, et al.
Hebrew University of Jerusalem

Consider an undirected graph G=(V,E). A subgraph of G is a subset of its edges, whilst an orientation of G is an assignment of a direction to each edge. Provided with an integer circulation-demand d:V→ℤ, we show an explicit and efficiently computable bijection between subgraphs of G on which a d-flow exists and orientations on which a d-flow exists. Moreover, given a cost function w:E→ (0,∞) we can find such a bijection which preserves the w-min-cost-flow. In 2013, Kozma and Moran showed, using dimensional methods, that the number of subgraphs k-connecting a vertex s to a vertex t is the same as the number of orientations k-connecting s to t. An application of our result is an efficient, bijective proof of this fact.


page 1

page 2

page 3

page 4


A limit theorem for the 1st Betti number of layer-1 subgraphs in random graphs

We initiate the study of local topology of random graphs. The high level...

Identifying a 3-vertex strongly biconnected directed subgraph with minimum number of edges

A strongly connected graph is strongly biconnected if after ignoring the...

Robot Subset Selection for Swarm Lifetime Maximization in Computation Offloading with Correlated Data Sources

Consider robot swarm wireless networks where mobile robots offload their...

Formulations for designing robust networks. An application to wind power collection

We are interested in the design of survivable capacitated rooted Steiner...

Computing all Wardrop Equilibria parametrized by the Flow Demand

We develop an algorithm that computes for a given undirected or directed...


In this paper, we present two new concepts related to subgraph counting ...

Hardness and approximation of the Probabilistic p-Center problem under Pressure

The Probabilistic p-Center problem under Pressure (Min PpCP) is a varian...

Please sign up or login with your details

Forgot password? Click here to reset