scholarly journals Integer flow and Petersen minor

2007 ◽  
Author(s):  
Taoye Zhang
Keyword(s):  
Integer Flow

L(p, q)-Labeling and Integer Flow on Planar Graphs

2012 ◽  
Vol 56 (6) ◽  
pp. 785-792 ◽  
Author(s):  
X. Zhang ◽  
J. Qian
Keyword(s):  
Planar Graphs ◽  
Integer Flow

Multiway cut and integer flow problems in trees

2004 ◽  
Vol 17 ◽  
pp. 105-109 ◽  
Author(s):  
Marie-Christine Costa ◽  
Alain Billionnet
Keyword(s):  
Flow Problems ◽  
Multiway Cut ◽  
Integer Flow

scholarly journals Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions

2020 ◽  
Vol 86 ◽  
pp. 105951
Author(s):  
Behrooz Ghasemishabankareh ◽  
Xiaodong Li ◽  
Melih Ozlen ◽  
Frank Neumann
Keyword(s):  
Minimum Cost ◽  
Cost Functions ◽  
Flow Problems ◽  
Convex Cost ◽  
Integer Flow

scholarly journals A generalized bi-criteria fuzzy integer flow sharing problem

2012 ◽  
Vol 53 (4) ◽  
pp. 480-492
Author(s):  
Yue Ge ◽  
Minghao Chen ◽  
Hiroaki Ishii
Keyword(s):  
Integer Flow

scholarly journals Heuristic solutions to robust variants of the minimum-cost integer flow problem

2020 ◽  
Vol 26 (4) ◽  
pp. 531-559
Author(s):  
Marko Špoljarec ◽  
Robert Manger
Keyword(s):  
Flow Problem ◽  
Minimum Cost ◽  
Integer Flow

scholarly journals Characteristic Flows on Signed Graphs and Short Circuit Covers

10.37236/4872 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Edita Máčajová ◽  
Martin Škoviera
Keyword(s):  
Classical Result ◽  
Short Circuit ◽  
Signed Graph ◽  
Signed Graphs ◽  
Total Length ◽  
Integer Flow

We generalise to signed graphs a classical result of Tutte [Canad. J. Math. 8 (1956), 13—28] stating that every integer flow can be expressed as a sum of characteristic flows of circuits. In our generalisation, the rôle of circuits is taken over by signed circuits of a signed graph which occur in two types — either balanced circuits or pairs of disjoint unbalanced circuits connected with a path intersecting them only at its ends. As an application of this result we show that a signed graph $G$ admitting a nowhere-zero $k$-flow has a covering with signed circuits of total length at most $2(k-1)|E(G)|$.

Integer flow theory

2012 ◽  
pp. 273-284
Author(s):  
Cun-Quan Zhang
Keyword(s):  
Flow Theory ◽  
Integer Flow

scholarly journals The difference between the circular and the integer flow number of bidirected graphs

2015 ◽  
Vol 338 (6) ◽  
pp. 866-867 ◽  
Author(s):  
Edita Máčajová ◽  
Eckhard Steffen
Keyword(s):  
Flow Number ◽  
Bidirected Graphs ◽  
Integer Flow ◽  
The Difference

scholarly journals Solving Robust Variants of Integer Flow Problems with Uncertain Arc Capacities

2021 ◽  
Vol 33 (1) ◽  
pp. 77-89
Author(s):  
Marko Špoljarec ◽  
Robert Manger
Keyword(s):  
Flow Problem ◽  
Network Flows ◽  
Minimum Cost ◽  
Maximum Flow ◽  
Approximate Algorithm ◽  
Minimum Cost Flow ◽  
Flow Problems ◽  
Unit Costs ◽  
Minimum Cost Flow Problem ◽  
Integer Flow

This paper deals with robust optimization and network flows. Several robust variants of integer flow problems are considered. They assume uncertainty of network arc capacities as well as of arc unit costs (where applicable). Uncertainty is expressed by discrete scenarios. Since the considered variants of the maximum flow problem are easy to solve, the paper is mostly concerned with NP-hard variants of the minimum-cost flow problem, thus proposing an approximate algorithm for their solution. The accuracy of the proposed algorithm is verified by experiments.

Sign in / Sign up

Export Citation Format

Share Document