AbstractThis paper considers polytopes of circulations (flows) on a graph which satisfy given linear (homogenous) constraints. Algebraic characterizations of the extreme points of such polytopes are obtained. We also characterize subgraphs which support extreme points. Finally, a formula (geometric in nature) is obtained for the dimension of the flow space of a set of cycles
A subset of vertices of a graph is called a dominating set if every vertex of the graph which is not...
We explore the structure of the cycle space of the graphs - most notably questions about nowhere-zer...
An extended formulation of a polytope is a linear description of this polytope using extra variables...
AbstractThis paper considers polytopes of circulations (flows) on a graph which satisfy given linear...
We study capacitated network flow problems with demands defined on a countably infinite collection o...
AbstractLet G=(V,A) be a graph with vertex set V and arc set A. A flow for G is an arbitrary real-va...
We suggest defining the structure of an unoriented graph Rd on the set of reflexive polytopes of a f...
. In this paper we give a flow model on directed multigraphs by introducing reflexions of generalize...
This paper discusses the balanced circulation polytope, that is, the convex hull of balanced circula...
In this paper we study the extreme points of the polytope P(G), the linear relaxation of the 2-edge ...
AbstractWe suggest defining the structure of an unoriented graph Rd on the set of reflexive polytope...
AbstractA theorem is established that provides necessary and sufficient conditions in order that a l...
In this paper we study the extreme points of the polytope P(G), the linear relaxation of the 2-edge ...
A flow network N is a capacited finite directed graph, with multiple sources (or input arcs) and mul...
AbstractThe object of this paper is a simple characterization of the vertices and extreme rays of th...
A subset of vertices of a graph is called a dominating set if every vertex of the graph which is not...
We explore the structure of the cycle space of the graphs - most notably questions about nowhere-zer...
An extended formulation of a polytope is a linear description of this polytope using extra variables...
AbstractThis paper considers polytopes of circulations (flows) on a graph which satisfy given linear...
We study capacitated network flow problems with demands defined on a countably infinite collection o...
AbstractLet G=(V,A) be a graph with vertex set V and arc set A. A flow for G is an arbitrary real-va...
We suggest defining the structure of an unoriented graph Rd on the set of reflexive polytopes of a f...
. In this paper we give a flow model on directed multigraphs by introducing reflexions of generalize...
This paper discusses the balanced circulation polytope, that is, the convex hull of balanced circula...
In this paper we study the extreme points of the polytope P(G), the linear relaxation of the 2-edge ...
AbstractWe suggest defining the structure of an unoriented graph Rd on the set of reflexive polytope...
AbstractA theorem is established that provides necessary and sufficient conditions in order that a l...
In this paper we study the extreme points of the polytope P(G), the linear relaxation of the 2-edge ...
A flow network N is a capacited finite directed graph, with multiple sources (or input arcs) and mul...
AbstractThe object of this paper is a simple characterization of the vertices and extreme rays of th...
A subset of vertices of a graph is called a dominating set if every vertex of the graph which is not...
We explore the structure of the cycle space of the graphs - most notably questions about nowhere-zer...
An extended formulation of a polytope is a linear description of this polytope using extra variables...