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
. In this paper we give a flow model on directed multigraphs by introducing reflexions of generalize...
AbstractA linear-time algorithm that reduces the set of flows on a directed graph with an additional...
AbstractGiven an Eulerian multigraph, a subset T of its vertices, and a collection H of subsets of T...
AbstractThis paper considers polytopes of circulations (flows) on a graph which satisfy given linear...
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 study capacitated network flow problems with demands defined on a countably infinite collection o...
In this document are given Linear Program formulations of several graph problems related to the acyc...
AbstractLet K be an unbounded convex polyhedral subset of Rn represented by a system of linear const...
We study capacitated network flow problems with demands defined on a countably infinite collection o...
In this thesis, we study several generalizations of Turan type problems in graphs and hypergraphs. I...
Dans cette thèse, nous considérons plusieurs paramètres des hypergraphes et nous étudions si les res...
In this thesis, we explore several mathematical questions about substructures in graphs and hypergra...
The aim of this paper is to propose a solution method for the minimization of a class of generalized...
AbstractA general theorem on the nesting property of minimum cuts in a parametric network and its co...
In this thesis, we consider several hypergraph parameters and study whether restrictions to subclass...
. In this paper we give a flow model on directed multigraphs by introducing reflexions of generalize...
AbstractA linear-time algorithm that reduces the set of flows on a directed graph with an additional...
AbstractGiven an Eulerian multigraph, a subset T of its vertices, and a collection H of subsets of T...
AbstractThis paper considers polytopes of circulations (flows) on a graph which satisfy given linear...
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 study capacitated network flow problems with demands defined on a countably infinite collection o...
In this document are given Linear Program formulations of several graph problems related to the acyc...
AbstractLet K be an unbounded convex polyhedral subset of Rn represented by a system of linear const...
We study capacitated network flow problems with demands defined on a countably infinite collection o...
In this thesis, we study several generalizations of Turan type problems in graphs and hypergraphs. I...
Dans cette thèse, nous considérons plusieurs paramètres des hypergraphes et nous étudions si les res...
In this thesis, we explore several mathematical questions about substructures in graphs and hypergra...
The aim of this paper is to propose a solution method for the minimization of a class of generalized...
AbstractA general theorem on the nesting property of minimum cuts in a parametric network and its co...
In this thesis, we consider several hypergraph parameters and study whether restrictions to subclass...
. In this paper we give a flow model on directed multigraphs by introducing reflexions of generalize...
AbstractA linear-time algorithm that reduces the set of flows on a directed graph with an additional...
AbstractGiven an Eulerian multigraph, a subset T of its vertices, and a collection H of subsets of T...